Approximation algorithms for constrained node weighted steiner tree problems

SIAM Journal on Computing

Volumn 37, Issue 2, 2007, Pages 460-481

  Moss, A ^a   Rabani, Y ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Combinatorial approximation algorithms; Network design; Node weighted problems

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION; PROBLEM SOLVING; PROFITABILITY; TREES (MATHEMATICS);

COMBINATORIAL APPROXIMATION ALGORITHMS; NETWORK DESIGN; NODE-WEIGHTED PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 42549130433     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702420474     Document Type: Article

References (18)

1. S. ARORA AND G. KARAKOSTAS (2006), A 2 + ε approximation algorithm for the k-MST problem, Math. Program., 107, pp. 491-504.
2. S. ARORA AND C. LUND (1997), Hardness of approximations, in Approximation Algorithms for NP-Hard Problems, PWS Publishing, Boston, MA.
3. B. AWERBUCH, Y. AZAR, A. BLUM, AND S. VEMPALA (1998), New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen, SIAM J. Comput., 28, pp. 254-262.
4. A. BLUM. R. RAVI, AND S. VEMPALA (1999), A constant factor approximation for the k-MST problem, J. Comput. System Sci., 58, pp. 101-108.
5. R. CARR AND S. VEMPALA (2002), Randomized metarounding, Random Structures Algorithms, 20, pp. 343-352.
6. M. CHARIKAR AND S. GUHA (2005), Improved combinatorial algorithms for facility location problems, SIAM J. Comput., 34, pp. 803-824.
7. F. CHUDAK, T. ROUGHGARDEN, AND D. P. WILLIAMSON (2004), Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangian relaxation, Math. Program., 100, pp. 411-421.
8. R. DIESTEL, (2000), Graph Theory, 2nd ed., Graduate Texts in Mathematics 173, Springer-Verlag, Berlin.
9. N. GARG (1996), A 3-approximation for the minimum tree spanning k vertices, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pp. 302-309.
10. N. GARG (2005), Saving an epsilon: A 2-approximation for the k-MST problem in graphs, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 396-402.
11. M. X. GOEMANS AND D. P. WILLIAMSON (1995), A general approximation technique for constrained forest problems, SIAM J. Comput., 24, pp. 296-317.
12. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER (1993), Geometric Algorithms and Combinatorial Optimization, 2nd corrected ed., Springer-Verlag, Berlin.
13. S. GUHA, A. MOSS, J. NAOR, AND B. SCHIEBER (1999), Efficient recovery from power outage, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 574-582.
14. K. JAIN AND V. V. VAZIRANI (2001), Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation, J. ACM, 48, pp. 274-296.
15. D. S. JOHNSON. M. MINKOFF, AND S. PHILLIPS (2000), The prize collecting Steiner tree problem: Theory and practice, in Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms.
16. S. KHULLER, A. MOSS, AND S. NAOR (1998), The budgeted maximum coverage problem, Inform. Process. Lett., 70, pp. 39-45.
17. P. KLEIN AND R. RAVI (1995), A nearly best-possible approximation algorithm for node-weighted Steiner trees, J. Algorithms, 19, pp. 104-115.
18. A. MOSS (2001), High Profit for Low Cost: Approximation Algorithms in Node-Weighted Graphs, Ph.D. thesis, Technion, Haifa, Israel.