Deterministic hypergraph coloring and its applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1518, Issue , 1998, Pages 35-46

  Lu, Chi Jen ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; RANDOM PROCESSES; SET THEORY;

DIMENSION BOUNDS; DIVIDE-AND-CONQUER APPROACH; HYPERGRAPH; HYPERGRAPH COLORING; ITS APPLICATIONS; PARTIALLY ORDERED SET; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; VERTEX COLORING;

APPROXIMATION ALGORITHMS;

EID: 84958603897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49543-6_4     Document Type: Conference Paper

References (12)

1. N. Alon, A parallel algorithmic version of the local lemma, Random Structures and Algorithms, 2(4), pages 367-378, 1991
2. J. Beck, An algorithmic approach to the Lovász local lemma, Random Structures and Algorithms, 2(4), pages 343-365, 1991
3. 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.
4. 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.
5. Z. Füredi and J. Kahn, On the dimensions of ordered sets of bounded degree, Order, 3, pages 15-20, 1986.
6. 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.
7. 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.
8. N. Nisan, Pseudo-random bits for constant depth circuits, Combinatorica, 11(1), pages 63-70, 1991
9. th Annual IEEE Symposium on Foundations of Computer Science, pages 2-11, 1988.
10. P. Raghavan, Probabilistic construction of deterministic algorithm: Approximating packing integer programs, Journal of Computer and System Sciences, 38, pages 683-707, 1994.
11. 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.
12. L. G. Valiant, The complexity of enumeration and reliability problems, SIAM Journal on Computing, 8, pages 410-421, 1979.