On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An extension of the Lovász local lemma, and its applications to integer programming
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On Constrained Hypergraph Coloring and Scheduling
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
| Hi-index | 0.00 |
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].