Partitioning problems in dense hypergraphs

被引：0
|
作者：
Czygrinow, A [1 ]
机构：
[1] Arizona State Univ, Dept Math, Tempe, AZ 85287 USA
来源：
DISCRETE APPLIED MATHEMATICS | 2002年 / 116卷 / 03期
关键词：
partitioning problem; approximation algorithm; the regularity lemma;
D O I：
10.1016/S0166-218X(00)00323-1
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We study the general partitioning problem and the discrepancy problem in dense hypergraphs. Using the regularity lemma (Szemeredi, Problemes Combinatories et Theorie des Graphes (1978), pp. 399-402) and its algorithmic version proved in Czygrinow and Rodl (SIAM J. Comput., to appear), we give polynomial-time approximation schemes for the general partitioning problem and for the discrepancy problem. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：179 / 191
页数：13
相关论文
共 50 条
  • [1] Partitioning dense uniform hypergraphs
    Shufei Wu
    Jianfeng Hou
    Journal of Combinatorial Optimization, 2018, 35 : 48 - 63
  • [2] Partitioning dense uniform hypergraphs
    Wu, Shufei
    Hou, Jianfeng
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 35 (01) : 48 - 63
  • [3] Extremal problems in uniformly dense hypergraphs
    Reiher, Christian
    EUROPEAN JOURNAL OF COMBINATORICS, 2020, 88
  • [4] The Complexity of Perfect Matching Problems on Dense Hypergraphs
    Karpinski, Marek
    Rucinski, Andrzej
    Szymanska, Edyta
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 626 - +
  • [5] On partitioning of hypergraphs
    Bezrukov, Sergei L.
    Battiti, Roberto
    DISCRETE MATHEMATICS, 2007, 307 (14) : 1737 - 1753
  • [6] High dimensional data clustering by partitioning the hypergraphs using dense subgraph partition
    Sun, Xili
    Tian, Shoucai
    Lu, Yonggang
    MIPPR 2015: PATTERN RECOGNITION AND COMPUTER VISION, 2015, 9813
  • [7] Partitioning ordered hypergraphs
    Furedi, Zoltan
    Jiang, Tao
    Kostochka, Alexandr
    Mubayi, Dhruv
    Verstraete, Jacques
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2021, 177
  • [8] Hypergraphs with vanishing Turan density in uniformly dense hypergraphs
    Reiher, Christian
    Roedl, Vojtech
    Schacht, Mathias
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2018, 97 : 77 - 97
  • [9] Replicated partitioning for undirected hypergraphs
    Selvitopi, R. Oguz
    Turk, Ata
    Aykanat, Cevdet
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2012, 72 (04) : 547 - 563
  • [10] Transversal partitioning in balanced hypergraphs
    Dahlhaus, E
    Kratochvil, J
    Manuel, PD
    Miller, M
    DISCRETE APPLIED MATHEMATICS, 1997, 79 (1-3) : 75 - 89
12345