On dependent randomized rounding algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1084, Issue , 1996, Pages 330-344

  Bertsimas, Dimitris ^a   Teo, Chung Piaw ^a   Vohra, Rakesh ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84927134775     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_25     Document Type: Conference Paper

References (26)

1. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley, New York, 1992.
2. M. Bazaraa, J. Jarvis and H. Sherali. Linear Programming and Network Flows, 2nd ed. Wiley, New York, 1990.
3. D. Bertsimas, C. Teo and R. Vokra. Nonlinear relaxations and improved randomized approximation algorithms for multicut problems, Proc. 4th IPCO Conference, 29-39, 1995.
4. D. Bertsimas and R. Vohra. Linear programming relaxations, approximation algorithms and randomization: a unified view of covering problems, Preprint 1994.
5. H. Brönnimann and M. Goodrich. Almost optimal set covers in finite VC-dimension, Proc 10th Annual Symp. Computational Geometry, 293-301, 1994.
6. S. Chopra, I. Gilboa and T. Sastry. Source sink flows with capacity installation in batches, preprint, 1995.
7. G. Cornuejols, M. Fisher and G. Nemhauser. Location of Bank Accounts to optimize float: An analytic study of exact and approximate algorithms, Management Science, 23, 789-810, 1977.
8. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4, 233-235, 1979.
9. W. Fernandez de la Vega and G. Lueker. Bin packing solved within 1+e in linear time, Combinatorica, 1, 349-355, 1981.
10. M.X. Goemans and D. Williamson. A new 3/4 approximation algorithm for MAX SAT, Proc. 3rd IPGO Conference, 313-321, 1993.
11. M.X. Goemans and D. Williamson. 878 approximation algorithms for MAX-CUT and MAX 2SAT, Proc. 26th Annual ACM STOC, 422-431, 1994.
12. M. Grötschel and L. Lovász. Combinatorial Optimization: A survey, DIMACS Technical Report 93-29, 1993.
13. P. Hansen and B. Simeone. Unimodular functions, Discrete Applied Mathematics, 14, 269-281, 1986.
14. F. Harary. On the notion of balance of a signed graph, Michig. Math. Journal, 2, 143-146, 1953.
15. D. Hochbaum. Approximation algorithms for Set Covering and Vertex Cover Problems, SIAM Journal on Computing, 11, 555-556, 1982.
16. R. Kohli, R. Khrishnamurti and P. Mirchandani. The minimum satisfiability problem, SIAM Journal of Discrete Mathematics, 7(2), 275-283, 1994.
17. R. Loulou. Minimal cut cover of a graph with an application to the testing of electronic boards, Operations Research Letters, 12, 301-305, 1992.
18. T. Magnanti and P. Mirchandani. Shortest paths, single origin-destination network design, and associated polyhedra, Networks, 23, 103-121, 1993.
19. M. Marathe and S. Ravi. On approximation algorithms for the minimum satisfiability problems, Preprint, 1995.
20. R. Motwani and J. Naor. On exact and approximate cut covers of graphs, Preprint, 1993.
21. R. Motwani and P. Raghavan. Randomized Algorithms, Cambridge University Press, 1995.
22. G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization, Wiley, New York, 1988.
23. P. Raghavan and C. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorial, 7, 365-374, 1987.
24. D. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem, Math Programming, 62, 461-474, 1993.
25. A. Srinivasan. Improved Approximations of Packing and Covering Problems, Proceedings of the 28th Annual Symposium on Theory of Computing, 268-276, 1995.
26. M. Yannakakis. On the approximation of maximum satisfiability, Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, 1-9, 1992.