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 条
  • [41] Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
    Hou, Jianfeng
    Zeng, Qinghou
    COMBINATORICS PROBABILITY & COMPUTING, 2017, 26 (02): : 267 - 284
  • [42] Min–Max Partitioning of Hypergraphs and Symmetric Submodular Functions
    Karthekeyan Chandrasekaran
    Chandra Chekuri
    Combinatorica, 2023, 43 : 455 - 477
  • [43] Extremal problems for geometric hypergraphs
    Dey, TK
    Pach, J
    DISCRETE & COMPUTATIONAL GEOMETRY, 1998, 19 (04) : 473 - 484
  • [44] Polynomial-time perfect matchings in dense hypergraphs
    Keevash, Peter
    Knox, Fiachra
    Mycroft, Richard
    ADVANCES IN MATHEMATICS, 2015, 269 : 265 - 334
  • [45] Degree sequences of sufficiently dense random uniform hypergraphs
    Greenhill, Catherine
    Isaev, Mikhail
    Makai, Tamas
    McKay, Brendan D.
    COMBINATORICS PROBABILITY AND COMPUTING, 2023, 32 (02) : 183 - 224
  • [46] On a generalisation of Mantel's Theorem to Uniformly Dense Hypergraphs
    Reiher, Christian
    Rodl, Vojtech
    Schacht, Mathias
    INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2018, 2018 (16) : 4899 - 4941
  • [47] On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs
    Qingsong Tang
    Yuejian Peng
    Xiangde Zhang
    Cheng Zhao
    Journal of Optimization Theory and Applications, 2014, 163 : 31 - 56
  • [48] Polynomial-Time Perfect Matchings in Dense Hypergraphs
    Keevash, Peter
    Knox, Fiachra
    Mycroft, Richard
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 311 - 320
  • [49] Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs
    Karpinski, Marek
    Rucinski, Andrzej
    Szymanska, Edyta
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 662 - +
  • [50] The Erdos-Faber-Lovasz conjecture for dense hypergraphs
    Sanchez-Arroyo, Abdon
    DISCRETE MATHEMATICS, 2008, 308 (5-6) : 991 - 992
12345