Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Existence and construction of edge disjoint paths on expander graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Improved Approximation Algorithms for Shop Scheduling Problems
SIAM Journal on Computing
Algorithmic Chernoff-Hoeffding inequalities in integer programming
Random Structures & Algorithms
Approximation algorithms for scheduling
Approximation algorithms for NP-hard problems
Tight approximations for resource constrained scheduling and bin packing
Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Further algorithmic aspects of the local lemma
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Zero knowledge and the chromatic number
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
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
Better approximation guarantees for job-shop scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The Algorithmic Aspects of Uncrowded Hypergraphs
SIAM Journal on Computing
Improved Approximation Guarantees for Packing and Covering Integer Programs
SIAM Journal on Computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning
SIAM Journal on Computing
On Constrained Hypergraph Coloring and Scheduling
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Graphs and Hypergraphs
Simulating (log/sup c/n)-wise independence in NC
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
An algorithmic approach to the lovász local lemma. I
Random Structures & Algorithms
A parallel algorithmic version of the local lemma
Random Structures & Algorithms
Random Structures & Algorithms
| Hi-index | 0.00 |
Probabilistic methods have advanced the design of algorithms in algorithmic discrete mathematics and theoretical computer science. Many notoriously hard algorithmic problems have been solved with randomized algorithms or probabilistic methods, either optimally or in a satisfactory approximative way. One of the powerful tools in analyzing randomized approximation algorithms is the Lovász-Local-Lemma, a sieve method with many nice applications. In this article we show its impact on job shop scheduling and resource constrained scheduling.