Abstract
We consider the design of approximation algorithms for multicolor generalization of the well known hypergraph 2-coloring problem (property B). Consider a hypergraph H with n vertices, s edges, maximum edge degree \( \mathfrak{D}\left( { \leqslant s} \right) \) and maximum vertex degree d(≤ s). We study the problem of coloring the vertices of H with minimum number of colors such that no hyperedge i contains more than b i vertices of any color. The main result of this paper is a deterministic polynomial time algorithm for constructing approximate, ⌈(1 + ∈)OPT⌉-colorings (∈ ∈ (0, 1)) satisfying all constraints provided that b i’s are logarithmically large in d and two other parameters. This approximation ratio is independent of s. Our lower bound on the bi’s is better than the previous best bound. Due to the similarity of structure these methods can also be applied to resource constrained scheduling. We observe, using the non-approximability result for graph coloring of Feige and Killian[4], that unless NP ⊆ ZPP we cannot find a solution with approximation ratio \( s^{\frac{1} {2} - \delta } \) in polynomial time, for any fixed small δ > 0.
supported by a DFG scholarship through Graduiertenkolleg-357: Effiziente Algorithmen und Mehrskalenmethoden
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
N. Alon, A parallel algorithmic version of the local lemma, Random Structures and Algorithms, 2(1991), 367–378.
J. Beck, An algorithmic approach to the Lovász Local Lemma, Random Structures and Algorithms, 2(1991), 343–365.
P. Erdös and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions in infinite and finite sets, A. Hajnal et al, eds, Colloq. Math. Soc. J. Bolyai 11, North Holland, Amsterdam, 1975, 609–627.
U. Feige and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer and System Sciences, 57(1998), 187–199.
M.R. Garey, R.L. Graham, D.S. Johnson and A.C.-C. Yao, Resource constrained scheduling as generalized bin packing, JCT Ser. A, 21(1976), 257–298.
M.R. Garey and D.S. Johnson, Computers and Intractability, W.H. Freeman and Company, New York, 1979.
M. Grötschel, L. Lovász and A. Schrijver, Geometric algorithms and combinatorial optimization, Springer-Verlag, 1988.
T. Leighton, Chi-Jen Lu, S. Rao and A. Srinivasan, Newalgorithmic aspects of the local lemma with applications to routing and partitioning, to appear in SIAM Journal on Computing.
J. K. Lenstra, D.B. Shmoys and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Math. Programming, 46(1990), 259–271.
Chi-Jen Lu, Deterministic hypergraph coloring and its applications, Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, 1998, 35–46.
M. Molloy and B. Reed, Further algorithmic aspects of the Lovász Local Lemma, Proc. 30th Annual ACM Symposium on Theory of Computing, 1998, 524–529.
P. Raghavan and C.D Thompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, 7(4)(1987), 365–374.
A. Srinivasan, An extension of the Lovász Local Lemma and its applications to integer programming, ACM-SIAM Symposium on Discrete Algorithms, 1996, 6–15.
A. Srivastav and P. Stangier, Algorithmic Chernoff-Hoeffding inequalities in integer programming, Random Structures and Algorithms, 8(1)(1996), 27–58.
A. Srivastav and P. Stangier, Tight approximations for resource constrained scheduling and bin packing, Discrete Applied Math, 79(1997), 223–245.
W.F. de la Vega and C.S Lueker, Bin packing can be solved within (1+∈) in linear time, Combinatorica, 1(1981), 349–355.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahuja, N., Srivastav, A. (2002). On Constrained Hypergraph Coloring and Scheduling. In: Jansen, K., Leonardi, S., Vazirani, V. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2002. Lecture Notes in Computer Science, vol 2462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45753-4_4
Download citation
DOI: https://doi.org/10.1007/3-540-45753-4_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44186-1
Online ISBN: 978-3-540-45753-4
eBook Packages: Springer Book Archive