Randomized rounding without solving the linear program

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 170-178

  Young, Neal E ^a,b  

^a LUCENT TECHNOLOGIES   (United States)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

LINEAR PROGRAMS; MATRIX GAME; PACKING AND COVERINGS; PROBABILISTIC METHODS; RANDOMIZED ROUNDING; ROUNDING ALGORITHM;

LINEAR PROGRAMMING;

EID: 85012983438     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Noga Alon and Joel H. Spencer. The Probabilistic Method. John Wiley and Sons, New York, 1992.
2. Ingo Althöfer. On sparse approximations to randomized strategies and convex combinations. Linear Algebra and its Applications, 199, March 1994.
3. Dimitris Bertsimas and Rakesh Vohra. Linear programming relaxations, approximation algorithms and randomization; a unified view of covering problems. Draft, January 1994.
4. H. Brönnimann and Michael T. Goodrich. Almost optimal set covers in bounded VC-dimension. In Proc. of the 10th Annual Symposium on Computational Geometry, 1994.
5. M. D. Grigoriadis and L. G. Kachiyan. Approximate Solution of Matrix Games in Parallel, pages 129-136. Elsevier Science Publishers B.V., 1992. Also available as TR-91-73 from DIMACS.
6. M. D. Grigoriadis and L. G. Kachiyan. A sublinear-time randomized approximation algorithm for matrix games. Technical Report LCSR-TR-222, Rutgers University Computer Science Department, New Brunswick, NJ, April 1994.
7. Wassily Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Journal, pages 13-30, March 1963.
8. Thomas Hofmeister and Hanno Lefmann. Computing sparse approximations deterministically. Unpublished manuscript, Dortmund, Germany. hofmeist, lefmann@ls2.informatik.uni-dortmund.de, 1994.
9. Joseph Jájá. Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, Inc., 1992.
10. David S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
11. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 23(3):466-487, June 1994.
12. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. In Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, pages 101111, 1991.
13. Richard J. Lipton and Neal E. Young. Simple strategies for large zero-sum games with applications to complexity theory. In Proc. of the 26th Ann. ACM Symp. on Theory of Computing, 1994. To appear.
14. László Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
15. Michael Luby and Noam Nisan. A parallel approximation algorithm for positive linear programming. In Proc. of the 25th Ann. ACM Symp. on Theory of Computing, pages 448-457, 1993.
16. Serge Plotkin, David Shmoys, and Eva Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proc. of the 32nd IEEE Annual Symp. on Foundation of Computer Science, pages 495504, 1991.
17. Prabhakar Raghavan. Probabilistic construction of deterministic algorithms approximating packing integer programs. Journal of Computer and System Sciences, 37(2).130-143, October 1988.
18. Prabhakar Raghavan and C. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
19. F. Shahroki and D. W. Matula. The maximum concurrent flow problem. Journal of the ACM, 37:318-334, 1990.
20. Joel H. Spencer. Ten Lectures on the Probabilistic Method. Society for Industrial and Applied Mathematics, 3600 University City Science Center, Philadelphia, PA 19104-2688, 1987.