Abstract
Given a hypergraph and a set of colors, we want to find a vertex coloring to minimize the size of any monochromatic set in an edge. We give deterministic polynomial time approximation algorithms with performances close to the best bounds guaranteed by existential arguments. This can be applied to support divide and conquer approaches to various problems. We give two examples. For deterministic approximate DNF counting, this helps us explore the importance of a previously ignored parameter, the maximum number of appearance of any variable, and construct algorithms that are particularly good when this parameter is small. For partially ordered sets, we are able to constructivize the dimension bound given by Füredi and Kahn [5].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Alon, A parallel algorithmic version of the local lemma, Random Structures and Algorithms, 2(4), pages 367–378, 1991
J. Beck, An algorithmic approach to the Lovász local lemma, Random Structures and Algorithms, 2(4), pages 343–365, 1991
G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velicković, Approximations of general independent distributions. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 10–16, 1992.
P. Erdös and L. Lovász, problems and results on 3-chromatic hypergraphs and some related questions, in A. Hajnal et. al. Eds, Infinite and Finite Sets, North Holland, 1975, pages 609–628.
Z. Füredi and J. Kahn, On the dimensions of ordered sets of bounded degree, Order, 3, pages 15–20, 1986.
M. Luby and B. Velicković, On deterministic approximate counting of DNF, In Proceedings of the 23nd Annual ACM Symposium on Theory of Computing, pages 430–438, 1991.
M. Luby, B. Velicković, and A. Wigderson, Deterministic approximate counting of depth-2 circuits, In Proceedings of the Second Israeli Symposium on Theory of Computing and Systems, 1993.
N. Nisan, Pseudo-random bits for constant depth circuits, Combinatorica, 11(1), pages 63–70, 1991
N. Nisan and A. Wigderson, Hardness vs. randomness, In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 2–11, 1988.
P. Raghavan, Probabilistic construction of deterministic algorithm: Approximating packing integer programs, Journal of Computer and System Sciences, 38, pages 683–707, 1994.
A. Srinivasan, An extension of the Lovász Local Lemma, and its applications to integer programming, In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 6–15, 1996.
L. G. Valiant, The complexity of enumeration and reliability problems, SIAM Journal on Computing, 8, pages 410–421, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, CJ. (1998). Deterministic Hypergraph Coloring and Its Applications. In: Luby, M., Rolim, J.D.P., Serna, M. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1998. Lecture Notes in Computer Science, vol 1518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49543-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-49543-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65142-0
Online ISBN: 978-3-540-49543-7
eBook Packages: Springer Book Archive