Abstract
We study three different de-randomization methods that are often applied to approximate combinatorial optimization problems. We analyze the conditional probabilities method in connection with randomized rounding for routing, packing and covering integer linear programming problems. We show extensions of such methods for non-independent randomized rounding for the assignment problem. The second method, the so-called random walks is exemplified with algorithms for dense instances of some NP problems. Another often used method is the bounded independence technique; we explicit this method for the sparsest cut and maximum concurrent flow problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon and J. Spencer, The Probabilistic Method, Wiley Inter-science, 1992.
S. Arora, "Nearly linear time approximation schemes for Euclidean TSP and other geometric problems," Manuscript, 1997.
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.
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.
Y. Aumann and Y. Rabani, "An O(log k)approximate min-cut max-flow theorem and approximation algorithm," SIAM Journal on Computing, to appear.
D. Avis and M. Deza, "The cut cone, l 1 embeddability, complexity, and multicommodity flows," Networks, vol. 21, pp. 595-617, 1991.
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.
B. Berger, "The fourth moment method," SIAM Journal on Computing, vol. 26, no.4, pp. 1188-1207, 1997.
W.F. de la Vega, "MAXCUT has a randomized approximation scheme in dense graphs," Random Structures and Algorithms, vol. 8, pp. 187-198, 1996.
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.
N. Garg, "A deterministic O(log k)-approximate algorithm for the sparsest cut problem," 1995, Manuscript cited in (Shmoy, 1996).
D. Gillman, "Achernoff bound for randomwalks on expander graphs," in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 680-691.
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.
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.
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.
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.
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.
P. Raghavan, "Probabilistic construction of deterministic algorithms: Approximating packing integer programs," Journal of Computer and System Sciences, vol. 37, pp. 130-143, 1988.
P. Raghavan and C.D. Thompson, "Randomized rounding: A technique for provably good algorithms and algorithmic proofs," Combinatorica, vol. 7, pp. 365-374, 1987.
D. Shmoys, "Cut problems and their applications to divide-and-conquer," in Approximation Algorithms forNP-Hard Problems, D. Hochbaum (Ed.), PWS Publishing, 1996, pp. 192-235.
A. Srinivasan, "Improved approximations of packing and covering problems," in Proceedings of the 27th ACM Symposium on Theory of Computing, 1995, pp. 268-276.
A. Srivastav and P. Stangier, "Algorithmic chernoff-hoeffding inequalities in integer programming," Random Structures and Algorithms, 1996. Preliminary version in Proc. of ISAAC'94.
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.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rolim, J.D., Trevisan, L. A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms. Journal of Combinatorial Optimization 2, 219–236 (1998). https://doi.org/10.1023/A:1009793909670
Issue Date:
DOI: https://doi.org/10.1023/A:1009793909670