Title of article
Partitioning problems in dense hypergraphs Original Research Article
Author/Authors
A. Czygrinow، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
13
From page
179
To page
191
Abstract
We study the general partitioning problem and the discrepancy problem in dense hypergraphs. Using the regularity lemma (Szemerédi, Problemes Combinatories et Theorie des Graphes (1978), pp. 399–402) and its algorithmic version proved in Czygrinow and Rödl (SIAM J. Comput., to appear), we give polynomial-time approximation schemes for the general partitioning problem and for the discrepancy problem.
Keywords
Partitioning problem , Approximation algorithm , The regularity lemma
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885337
Link To Document