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 条
  • [21] Finding Perfect Matchings in Dense Hypergraphs
    Han, Jie
    Keevash, Peter
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2366 - 2377
  • [22] Eigenvalue Approach to Dense Clusters in Hypergraphs
    Billig, Yuly
    JOURNAL OF GRAPH THEORY, 2025,
  • [23] Extremal problems for convex geometric hypergraphs and ordered hypergraphs
    Furedi, Zoltan
    Jiang, Tao
    Kostochka, Alexandr
    Mubayi, Dhruv
    Verstraete, Jacques
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 2021, 73 (06): : 1648 - 1666
  • [24] Application of fast DC analysis to partitioning hypergraphs
    Trivedi, Gaurav
    Narayanan, H.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, 2007, : 3407 - 3410
  • [25] Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications
    Papp, Pal Andras
    Anegg, Georg
    Yzelman, Albert-Jan N.
    PROCEEDINGS OF THE 35TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2023, 2023, : 415 - 425
  • [26] The complexity of perfect matchings and packings in dense hypergraphs
    Han, Jie
    Treglown, Andrew
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2020, 141 : 72 - 104
  • [27] Fractional clique decompositions of dense graphs and hypergraphs
    Barber, Ben
    Kuhn, Daniela
    Lo, Allan
    Montgomery, Richard
    Osthus, Deryk
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 127 : 148 - 186
  • [28] On Hamiltonian cycles in hypergraphs with dense link graphs
    Polcyn, Joanna
    Reiher, Christian
    Rodl, Vojtech
    Schuelke, Bjarne
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2021, 150 : 17 - 75
  • [29] Tight cycles and regular slices in dense hypergraphs
    Allen, Peter
    Bottcher, Julia
    Cooley, Oliver
    Mycroft, Richard
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2017, 149 : 30 - 100
  • [30] Dense graph partitioning on sparse and dense graphs
    Bazgan, Cristina
    Casel, Katrin
    Cazals, Pierre
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 150
12345