On dependent randomized rounding algorithms

Operations Research Letters

Volumn 24, Issue 3, 1999, Pages 105-114

  Bertsimas, Dimitris ^a   Teo, Chungpiaw ^c   Vohra, Rakesh ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; RANDOM PROCESSES;

RANDOMIZED ROUNDING ALGORITHMS;

LINEAR PROGRAMMING;

EID: 0032665104     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00010-3     Document Type: Article

References (21)

1. D. Bertsimas, C. Teo, R. Vohra, Nonlinear relaxations and improved randomized approximation algorithms for multicut problems, Proceedings of the Fourth IPCO Conference, 1995, pp. 29-39, in Networks, in press.
2. Bertsimas D., Vohra R. Rounding Algorithms for covering problems. Math. Programming. 80:1998;63-89.
3. H. Brönnimann, M. Goodrich, Almost optimal set covers in finite VC-dimension, Proceedings of the 10th Annual Symposium Computational Geometry, 1994, pp. 293-301.
4. Chvátal V. A greedy heuristic for the set-covering problem. Math. Oper. Res. 4:1979;233-235.
5. Fernandez de la Vega W., Lueker G. Bin packing solved within 1+. ε in linear time Combinatorica. 1:1981;349-355.
6. L.R. Ford, D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
7. M.X. Goemans, D. Williamson, A new 3/4 approximation algorithm for MAX SAT, Proceedings of the Third IPCO Conference, 1993, pp. 313-321.
8. M.X. Goemans, D. Williamson, .878 approximation algorithms for MAX-CUT and MAX 2SAT, Proceedings of the 26th Annual ACM STOC, 1994, pp. 422-431.
9. M. Grötschel, L. Lovász, Combinatorial Optimization: A survey, DIMACS Technical Report 93-29, 1993.
10. Hansen P., Simeone B. Unimodular functions. Discrete Appl. Math. 14:1986;269-281.
11. Hochbaum D. Approximation algorithms for set covering and vertex cover problems. SIAM J. Comput. 11:1982;555-556.
12. D. Hochbaum, Instant recognition of half integrality and 2-approximation, Proceedings of the APPROX98, Lecture Notes in Computer Science, vol. 1444, Springer, Berlin, 1998, pp. 99-110.
13. Kohli R., Khrishnamurti R., Mirchandani P. The minimum satisfiability problem. SIAM J. Discrete Math. 7(2):1994;275-283.
14. N. Linial, E. London, Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 577-591.
15. M. Marathe, S. Ravi, On approximation algorithms for the minimum satisfiability problems, preprint, 1995.
16. G. Nemhauser, L. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.
17. Raghavan P., Thompson C. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica. 7:1987;365-374.
18. R. Ravi, private communication.
19. Shmoys D., Tardos E. An approximation algorithm for the generalized assignment problem. Math. Programming. 62:1993;461-474.
20. M. Yannakakis, On the approximation of maximum satisfiability, Proceedings of the Third ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 1-9.
21. B. Yu, J. Cheriyan, Approximation algorithms for feasible cut and multicut problems, in: P. Spirakis (Ed.), Proceedings of the Algorithms - ESA'95, Third Annual European Symposium, Lecture Notes in Computer Science 979, Springer, New York, 1995, pp. 394-408.