New algorithmic aspects of the local lemma with applications to routing and partitioning

SIAM Journal on Computing

Volumn 31, Issue 2, 2001, Pages 626-641

  Leighton, Tom ^a   Lu, Chi Jen ^b   Rao, Satish ^c   Srinivasan, Aravind ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

Disjoint paths; Integer programming; Randomized rounding

Indexed keywords

INTEGER PROGRAMMING; POLYNOMIALS; PROBABILITY; ROUTERS; TREES (MATHEMATICS);

DISJOINT PATHS;

ALGORITHMS;

EID: 0036248026     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539700379760     Document Type: Article

References (25)

1. N. ALON, A parallel algorithmic version of the local lemma, Random Structures Algorithms, 2 (1991), pp. 367-378.
2. N. ALON, The strong chromatic number of a graph, Random Structures Algorithms, 3 (1992), pp. 1-7.
3. N. ALON AND J. H. SPENCER, The Probabilistic Method, Wiley-Interscience Series, John Wiley, New York, 1992.
4. J. BECK, An algorithmic approach to the Lovasz local lemma, Random Structures Algorithms, 2 (1991), pp. 343-365.
5. H. CHERNOFF, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statist., 23 (1952), pp. 493-509.
6. A. CZUMAJ AND C. SCHEIDELER, A new algorithmic approach to the general Lovász local lemma with applications to scheduling and satisfiability problems, in Proceedings of the ACM Symposium on Theory of Computing, ACM, Portland, OR, 2000, pp. 38-47.
7. P. ERDOS 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ános Bolyai 11, North Holland, Amsterdam, 1975, pp. 609-627.
8. A. FRIEZE, Edge-disjoint paths in expander graphs, In Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, 2000, pp. 717-725.
9. Z. FÜREDI AND J. KAHN, On the dimensions of ordered sets of bounded degree, Order, 3 (1986), pp. 15-20.
10. W. HOEFFDING, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc., 58 (1963), pp. 13-30.
11. J. KLEINBERG, Approximation Algorithms for Disjoint Paths Problems, Ph.D. thesis, Department of EECS, MIT, 1996.
12. H. J. KARLOFF AND D. B. SHMOYS, Efficient parallel algorithms for edge coloring problems, J. Alg., 8 (1987), pp. 39-52.
13. D. KNUTH, The Art of Computer Programming, vol. I, Addison Wesley, London, 1969, p. 396 (Exercise 11).
14. F. T. LEIGHTON, S. B. RAO, AND A. SRINIVASAN, Multi-commodity flow and circuit switching, in Proc. Hawaii International Conference on System Sciences, 1998, pp. 459-465.
15. M. LOMONOSOV, Combinatorial approaches to multiftow problems, Discrete Appl. Math., 11 (1985), pp. 1-94.
16. C.-J. Lu, Deterministic hypergraph coloring and its applications, in Proc. Workshop on Randomization and Approximation Techniques in Computer Science, Honolulu, HI, 1998, pp. 35-46.
17. M. MIDDENDORF AND F. PFEIFFER, On the complexity of the disjoint paths problem, Combinatorica, 13 (1993), pp. 97-107.
18. M. MOLLOY AND B. REED, Further algorithmic aspects of the Local lemma, in Proc. ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 524-529.
19. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, 1995.
20. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 38 (1994), pp. 683-707.
21. P. RAGHAVAN AND C. D. THOMPSON, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica, 7 (1987), pp. 365-374.
22. J. P. SCHMIDT, A. SIEGEL, AND A. SRINIVASAN, Chernoff-Hoeffding bounds for applications with limited independence, SIAM J. Discrete Math., 8 (1995), pp. 223-250.
23. P. D. SEYMOUR, On odd cuts and planar multicommodity flows, J. London Math. Soc., 42 (1981), pp. 178-192.
24. J. H. SPENCER, The probabilistic lens: Sperner, Turán and Brégman revisited, in A Tribute to Paul Erdos, A. Baker, B. Bollobás, A. Hajnal, eds., Cambridge University Press, 1990, pp. 391-396.
25. 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, ACM, New York, 1996, pp. 6-15.