Abstract
Randomization has proved to be a powerful technique in finding approximate solutions to difficult problems in combinatorial optimization. In this paper, we restrict ourselves to approximation algorithms that are efficient, and provably good. The focus of this paper is the use of randomized rounding. In this approach, one solves a relaxation of a problem in combinatorial optimization, and then uses randomization to return from the relaxation to the original optimization problem. Two kinds of relaxations of difficult combinatorial problems are considered: linear programming relaxations, and semidefinite programming relaxations. A number of concrete applications are given. This paper does not treat the very interesting applications of randomization in approximation algorithms for counting problems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. To appear in the SIAM Journal on Optimization, 1994.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 14–23, 1992.
S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 2–13, 1992.
M. Bellare and M. Sudan. Improved non-approximability results. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 184–193, 1994.
B. Berger and J. Rompel. Simulating (log ° n)-wise independence in NC. Journal of the ACM, 38: 1026–1046, 1991.
D. Bertsimas and R. Vohra. Linear programming relaxations, approximation algorithms and randomization: a unified view of covering problems. Technical Report OR 285-94, MIT, 1994.
A. Blum. New approximation algorithms for graph coloring. Journal of the ACM, 41: 470–516, 1994.
J. A. Bondy and U.S. R. Murty. Graph Theory With Applications. American Elsevier, 1977.
R.B. Boppana and M.M. Halldorson. Approximating maximum independent sets by excluding subgraphs. BIT, 32: 180–196, 1992.
C. Delorme and S. Poljak. Laplacian eigenvalues and the maximum cut problem. Mathematical Programming, 62: 557–574, 1993.
G.S. Ditlow and P. Raghavan. Timing-driven partitioning of PLAs. IBM Technical Disclosure Bulletin, 31, 1989.
U. Feige and M.X. Goemans. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. Submitted for publication, 1994.
A. Frieze and M. Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Submitted for publication, 1994.
S. Gao and M. Kaufmann. Channel routing of multiterminal nets. In 28th Annual Symposium on Foundations of Computer Science, pages 316–325, October 1987.
M. X. Goemans and D. P. Williamson. New 3/4-approximation algorithms for MAX SAT. To appear in SIAM J. Disc. Math., 1993.
M.X. Goemans and D.P. Williamson. 0.878-approximation algorithms for MAX-CUT and MAX-2SAT. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 422–431, 1994.
G.H. Golub and C.F. van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, MD, 1983.
M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1: 169–197, 1981.
D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9: 256–278, 1974.
D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994.
S. Khanna, N. Linial, and S. Safra. On the hardness of approximating the chromatic number. In Proceedings of the 2nd Israeli Symposium on Theory and Computing Systems, pages 250–260, 1993.
P.N. Klein and S. Sairam. A parallel randomized approximation scheme for shortest paths. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 750–758, 1992.
P.N. Klein, C. Stein, and É. Tardos. Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 310–321, 1990.
G. Kortsarz and D. Peleg. Generating low-degree 2-spanners. Technical Report CS93-07, The Weizmann Institute of Science, 1993.
J.-H. Lin and J.S. Vitter. ε-approximations with minimum packing constraint violation. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 771–782, 1992.
L. Lovász. On the Shannon capacity of a graph. IEEE Trans. Information Theory, IT-25: 1–7, 1979.
L. Lovász M. Grötschel and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1987.
R. Motwani, J. Naor, and M. Naor. The probabilistic method yields deterministic parallel algorithms. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 8–13, October 1989.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, 1994. In Press.
M. Naor and R.M. Roth. Optimal file sharing in distributed networks. In 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 515–525, 1991.
A.P-C. Ng, P. Raghavan, and C.D. Thompson. Experimental results for a linear program global router. Computers and Artificial Intelligence, 6(3): 229–242, 1987.
C.H. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, 43: 425–440, 1991.
S.A. Plotkin, D.B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. In 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 495–504, 1991.
W.R. Pulleyblank and P. Raghavan, 1994. Personal communication, IBM Yorktown Heights.
P. Raghavan. Probabilistic construction of deterministic algorithms: Approximating packing integer programs. Journal of Computer and System Sciences, 37: 130–143, October 1988.
P. Raghavan and C.D. Thompson. Randomized rounding. Combinatorica, 7: 365–374, 1987.
S. Sahni and T. Gonzalez. P-complete approximation problems. Journal of the ACM, 23: 555–565, 1976.
J.P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffdmg bounds for applications with limited independence. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 331–340, 1993.
A. Sinclair. Algorithms for Random Generation and Counting: A Markov Chain Approach. Progress in Theoretical Computer Science. Birkhauser, Boston, 1992.
J. Spencer. Six standard deviations suffice. Transactions of the American Mathematical Society, 289(2): 679–706, June 1985.
J. Spencer. Ten Lectures on the Probabilistic Method, SIAM, 1987.
M. Szegedy. A note on the θ number of Lovász and the generalized Delsarte bound. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994.
P.J.M. van Laarhoven and E.H.L. Aarts. Simulated Annealing: Theory and Applications. Mathematics and its Applications. Reidel Publishing Company, 1987.
A. Wigderson. Improving the performance guarantee for approximate graph coloring. Journal of the ACM, 30: 729–735, 1983.
M. Yannakakis. On the approximation of maximum satisfiability. In Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 1–9, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raghavan, P. (1994). Randomized approximation algorithms in combinatorial optimization. In: Thiagarajan, P.S. (eds) Foundation of Software Technology and Theoretical Computer Science. FSTTCS 1994. Lecture Notes in Computer Science, vol 880. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58715-2_133
Download citation
DOI: https://doi.org/10.1007/3-540-58715-2_133
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58715-6
Online ISBN: 978-3-540-49054-8
eBook Packages: Springer Book Archive