A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms

Journal of Combinatorial Optimization

Volumn 2, Issue 3, 1998, Pages 219-236

  Rolim, José D P ^a   Trevisan, Luca ^b  

^a UNIVERSITY OF GENEVA   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; RANDOM PROCESSES;

ASSIGNMENT PROBLEMS; BOUNDED INDEPENDENCE; COMBINATORIAL OPTIMIZATION PROBLEMS; CONDITIONAL PROBABILITIES; INTEGER LINEAR PROGRAMMING; MAXIMUM CONCURRENT FLOW; PACKING AND COVERINGS; RANDOMIZED ROUNDING;

APPROXIMATION ALGORITHMS;

EID: 0141977598     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009793909670     Document Type: Article

References (25)

1. N. Alon and J. Spencer, The Probabilistic Method, Wiley Inter-science, 1992.
2. S. Arora, "Nearly linear time approximation schemes for Euclidean TSP and other geometric problems," Manuscript, 1997.
3. S. Arora, A. Frieze, and H. Kaplan, "A new rounding procedure for the assignment problem with applications to dense graph arrangement problems," in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 21-30.
4. S. Arora, D. Karger, and M. Karpinski, "Polynomial time approximation schemes for dense instances of NP-hard problems," in Proceedings of the 27th ACM Symposium on Theory of Computing, 1995, pp 284-293.
5. Y. Aumann and Y. Rabani, "An O(log k) approximate min-cut max-flow theorem and approximation algorithm," SIAM Journal on Computing, to appear.
6. 1 embeddability, complexity, and multicommodity flows," Networks, vol. 21, pp. 595-617, 1991.
7. M. Bellare and J. Rompel, "Randomness-efficient oblivious sampling," in Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 276-287.
8. B. Berger, "The fourth moment method," SIAM Journal on Computing, vol. 26, no. 4, pp. 1188-1207, 1997.
9. W.F. de la Vega, "MAXCUT has a randomized approximation scheme in dense graphs," Random Structures and Algorithms, vol. 8, pp. 187-198, 1996.
10. A. Frieze and R. Kannan, "The regularity lemma and approximation schemes for dense problems," in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996.
11. N. Garg, "A deterministic O(log k) -approximate algorithm for the sparsest cut problem," 1995, Manuscript cited in (Shmoy, 1996).
12. D. Gillman, "A chernoff bound for random walks on expander graphs," in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 680-691.
13. M. Goemans and D. Williamson, "New 3/4-approximation algorithms for the maximum satisfiability problem," SIAM Journal on Discrete Mathematics, vol. 7, no. 4, pp. 656-666, 1994. Preliminary version in Proc. of IPCO'93.
14. M. Goemans and D. Williamson, "New 3/4-approximation algorithms for the maximum satisfiability problem," SIAM Journal on Discrete Mathematics, vol. 7, no. 4, pp. 656-666, 1994. Preliminary version in Proc. of IPCO'93.
15. O. Goldreich, S. Goldwasser, and D. Ron, "Property testing and its connection with learning and approximation," in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996.
16. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," in Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 577-591.
17. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica, vol. 15, no. 2, pp. 215-245, 1995.
18. P. Raghavan, "Randomized rounding and discrete Ham-Sandwich theorems: Provably good algorithms for routing and packing problems," Ph.D. Thesis, University of California at Berkeley, 1986.
19. P. Raghavan, "Probabilistic construction of deterministic algorithms: Approximating packing integer programs," Journal of Computer and System Sciences, vol. 37, pp. 130-143, 1988.
20. P. Raghavan and C.D. Thompson, "Randomized rounding: A technique for provably good algorithms and algorithmic proofs," Combinatorica, vol. 7, pp. 365-374, 1987.
21. D. Shmoys, "Cut problems and their applications to divide-and-conquer," in Approximation Algorithms for NP-Hard Problems, D. Hochbaum (Ed.), PWS Publishing, 1996, pp. 192-235.
22. A. Srinivasan, "Improved approximations of packing and covering problems," in Proceedings of the 27th ACM Symposium on Theory of Computing, 1995, pp. 268-276.
23. A. Srivastav and P. Stangier, "Algorithmic chernoff-hoeffding inequalities in integer programming," Random Structures and Algorithms, 1996. Preliminary version in Proc. of ISAAC'94.
24. A. Srivastav and P. Stangier, "Algorithmic chernoff-hoeffding inequalities in integer programming," Random Structures and Algorithms, 1996. Preliminary version in Proc. of ISAAC'94.
25. L. Trevisan, "Positive linear programming, parallel approximation, and PCP's," in Proceedings of the 4th European Symposium on Algorithms, LNCS 1136, Springer-Verlag, 1996, pp. 62-75.