How well can primal-dual and local-ratio algorithms perform?

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 943-955

  Borodin, Allan ^a   Cashman, David ^a   Magen, Avner ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING;

INTERVAL SCHEDULING; LOCAL-RATIO ALGORITHMS; STACK MODELS;

COMPUTER SCIENCE;

EID: 26444533455     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_76     Document Type: Conference Paper

References (24)

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized steiner problem on networks. SICOMP, 24:440-465, 1995.
2. S. Angelopoulos and A. Borodin. The power of priority algorithms for facility location and set cover, 2002.
3. E. M. Arkin and E. L. Silverberg. Scheduling jobs with fixed start and end times. Disc. Appl. Math, 18:1-8, 1987.
4. S. Arora, B. Bollobás, and L. Lovász. Proving integrality gaps without knowing the linear program. In Proceedings of the 43rd Annual IEEE Conference on Foundations of Computer Science, pages 313-322, 2002.
5. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. JACM, 48(5): 1069-1090, 2001.
6. R. Bar-Yehuda, A. Bendel, A. Freund, and D. Rawitz. Local ratio: A unified frame-work for approxmation algorithms in memoriam: Shimon even 1935-2004. Computing Surveys, 36:422-463, 2004.
7. R. Bar-Yehuda and S. Even. A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms, 2:198-203, 1981.
8. R. Bar-Yehuda, M. M. Halldorsson, J. Naor, H. Shachnai, and I. Shapira. Scheduling split intervals. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 732-741, 2002.
9. R. Bar-Yehuda and D. Rawitz. On the equivalence between the primal-dual schema and the local ratio technique. In 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, pages 24-35, 2001.
10. R. Bar-Yehuda and D. Rawitz. Using fractional primal-dual to schedule split intervals with demands, 2004.
11. A. Borodin, M. N. Nielsen, and C. Rackoff. (Incremental) priority algorithms. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002.
12. M. Alekhnovich A. Borodin, J. Buresh-Oppenheim, R. Impagliazzo, A. Magen, and T. Pitassi. Toward a model for backtracking and dynamic programming. Unpublished manuscript, 2004.
13. S. Davis and R. Impagliazzo. Models of greedy algorithms for graph problems. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, 2004.
14. T. Erlebach and F.C.R. Spieksma. Interval selection: Applications, algorithms, and lower bounds. Technical Report 152, Computer Engineering and Networks Laboratory, ETH, October 2002.
15. M. X. Goemans and D.P. Williamson. A general approximation technique for constrained forest problems. SICOMP, 24:296-317, 1995.
16. K. Jain and V. Vazirani. Approximation algorithms for the metric facility location problem and k-median problem using the primal-dual schema and lagrangian relaxation. JACM, 48:274-299, 2001.
17. P. Klein and R. Ravi. When cycles collapse: A general approximation technique for constrained two-connectivity problems. In Proceedings of the Third MPS Conference on Integer Programming and Combinatorial Optimization, pages 39-55, 1993.
18. Rajagopalan and Vazirani. On the bidirected cut relaxation for the metric steiner tree problem. In SODA, pages 742-751, 1999.
19. R. Raz and S. Safra. A sub-constant error-probability low-degree test, and sub-constant error-probability pep characterization of np. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 475-484, 1997.
20. G. Robins and A. Zelikovsky. Improved steiner tree approximation in graphs. In SODA, pages 770-779, 2001.
21. H. Saran, V. Vazirani, and N. Young. A primal-dual approach to approximation algorithms for network steiner problems. In Proceedings of the Indo-US workshop on Cooperative Research in Computer Science, pages 166-168, 1992.
22. Martin Thimm. On the approximability of the steiner tree problem. In Lecture Notes in Computer Science, page 678. Springer-Verlag Heidelberg, 2001.
23. V. V. Vazirani. Approximation algorithms. Springer-Verlag New York, Inc., 2001.
24. D. P. Williamson. The primal-dual method for approximation algorithms. Mathematical Programming, Series B, 91(3):447-478, 2002.