New primal-dual algorithms for Steiner tree problems

Computers and Operations Research

Volumn 34, Issue 7, 2007, Pages 2147-2167

  Melkonian, Vardges ^a  

^a OHIO UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Integer programming; Primal dual algorithm; Steiner tree

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

GENERALIZED STEINER TREE PROBLEM (GST); PRIMAL DUAL ALGORITHMS; QUASI BIPARTITE GRAPHS; STEINER TREE PROBLEM (DST);

TREES (MATHEMATICS);

EID: 33845343202     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.08.009     Document Type: Article

References (18)

1. Agrawal A., Klein P., and Ravi R. When trees collide: an approximation algorithm for generalized Steiner tree problems on networks. SIAM Journal on Computing 24 (1995) 440-456
2. Goemans MX, Goldberg A, Plotkin S, Shmoys D, Tardos E, Williamson DP. Improved approximations algorithms for network design problems, In: Proceedings of the Fifth Annual Symposium on Discrete Algorithms, 1994; p. 223-232.
3. Goemans M.X., and Williamson D.P. A general approximation technique for constrained forest problem. SIAM Journal on Computing 24 (1995) 296-317
4. Jain K., and Vazirani V. Primal-dual approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangean relaxation. Journal of ACM 48 (2001) 274-296
5. Rajagopalan S, Vazirani V. On the bidirected cut relaxation for the metric Steiner tree problem, In: Proceedings of 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999; p. 742-751.
6. Winter P. Steiner problem in networks: a survey. Networks 17 (1987) 129-167
7. Raz R, Safra S. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, 1997, p. 475-484.
8. Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974) 256-278
9. Lovász L. On the ratio of optimal integral and fractional covers. Discrete Mathematics 13 (1975) 383-390
10. Chvátal V. A greedy heuristic for the set covering problem. Mathematics of Operations Research 4 (1979) 233-235
11. Vazirani V. Approximation Algorithms (2001), Springer, Berlin
12. Bar-Yehuda R., and Even S. A linear time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms 2 (1981) 198-203
13. Charikar M., Chekuri C., Cheung T., Dai Z., Goel A., Guha S., and Li M. Approximation algorithms for directed Steiner problems. Journal of Algorithms 33 1 (1999) 73-91
14. Zelikovski A. A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica 18 (1997) 99-110
15. Wong R. A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming 28 (1984) 271-287
16. Polzin T, Daneshmand SV. primal-dual approaches to the Steiner problem. Electronic Colloquium on Computational Complexity (ECCC) (2000); 7(47): ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2000/TR00-047/index.html.
17. Jain K. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 1 (2001) 39-60
18. Melkonian V., and Tardos E. Primal-dual-based algorithms for a directed network design problem. INFORMS Journal on Computing 17 2 (2005) 159-174