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 条
  • [31] Reliability covering problems for hypergraphs
    Chernyak, AA
    CYBERNETICS AND SYSTEMS ANALYSIS, 1999, 35 (01) : 100 - 111
  • [32] RAMSEY PROBLEMS FOR BERGE HYPERGRAPHS
    Gerbner, Daniel
    Methuku, Abhishek
    Omidi, Gholamreza
    Vizer, Mate
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020, 34 (01) : 351 - 369
  • [33] On optimization problems in acyclic hypergraphs
    Kamiyama, Naoyuki
    INFORMATION PROCESSING LETTERS, 2023, 182
  • [34] Problems on chromatic polynomials of hypergraphs
    Zhang, Ruixue
    Dong, Fengming
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2020, 8 (02) : 241 - 246
  • [35] SPECTRAL EXTREMAL PROBLEMS FOR HYPERGRAPHS
    Keevash, Peter
    Lenz, John
    Mubayi, Dhruv
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (04) : 1838 - 1854
  • [36] Reliability covering problems for hypergraphs
    A. A. Chernyak
    Cybernetics and Systems Analysis, 1999, 35 : 100 - 111
  • [37] Steiner connectivity problems in hypergraphs
    Horsch, Florian
    Szigeti, Zoltan
    INFORMATION PROCESSING LETTERS, 2024, 183
  • [38] Extremal problems for geometric hypergraphs
    Dey, TK
    Pach, J
    ALGORITHMS AND COMPUTATION, 1996, 1178 : 105 - 114
  • [39] Extremal Problems for Geometric Hypergraphs
    T. K. Dey
    J. Pach
    Discrete & Computational Geometry, 1998, 19 : 473 - 484
  • [40] A global method for the limited K-partitioning of hypergraphs representing optimal design problems in complex machine systems
    Li Shuiping
    Wan Xiaoxue
    KYBERNETES, 2010, 39 (06) : 980 - 989
12345