Hardness and approximation results for packing steiner trees

Algorithmica (New York)

Volumn 45, Issue 1, 2006, Pages 21-43

  Cheriyan, Joseph ^a   Salavatipour, Mohammad R ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Approximation algorithms; Hardness of approximation; Packing problems; Steiner trees

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; HARDNESS; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; HARDNESS OF APPROXIMATION; PACKING PROBLEMS; STEINER TREES;

TREES (MATHEMATICS);

EID: 33646408798     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-005-1188-4     Document Type: Article

References (25)

1. S. Arora and C. Lund, Hardness of approximations, in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS, Boston, MA, 1996.
2. A. Baveja and A. Srinivasan, Approximation algorithms for disjoint paths and related routing and packing problems, Mathematics of Operations Research 25:255-280, 2000. Earlier version in FOCS 1997.
3. R. Carr and S. Vempala, Randomized metarounding, Random Structures and Algorithms, 20:343-352, 2002. Earlier version in STOC 2000.
4. M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, Approximation algorithms for directed Steiner problem, Journal of Algorithms 33(1):73-91, 1999. Earlier version in SODA 1998.
5. M. Charikar, J. Naor, and B. Schieber, Resource optimization in QoS multicast routing of real-time multimedia, Proc. 19th Annual IEEE INFOCOM, pp. 1518-1527, 2000.
6. J. Cheriyan and M.R. Salavatipour, Packing element-disjoint Steiner trees, Manuscript, 2004.
7. M. Chlebík and J. Chlebíková, Inapproximability results for bounded variants of optimization problems, Proc. 14th International Symposium on Fundamentals of Computation Theory (FCT2003), pp. 27-38, LNCS 2751, Springer, Berlin, 2003.
8. R. Diestel, Graph Theory, Springer, New York, 2000.
9. U. Feige, M. Halldorsson, G. Kortsarz, and A. Srinivasan, Approximating the domatic number, SIAM Journal on Computing 32(1): 172-195, 2002, Earlier version in STOC 2000.
10. P. Floréen, P. Kaski, J. Kohonen, and P. Orponen, Multicast time maximization in energy constrained wireless networks, Proc. 2003 Joint Workshop on Foundations of Mobile Computing (DIALMPOMC2003), San Diego, CA, pp. 50-58, 2003.
11. S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10(2):111-121, 1980.
12. A. Frank, T. Király, and M. Ktlesell, On decomposing a hypergraph into k connected sub-hypergraphs, Discrete Applied Mathematics 131(2):373-383, 2003.
13. M. Grotsehel, A. Martin, and R. Weismantel, The Steiner tree packing problem in VLSI design, Mathematical Programming 78:265-281, 1997.
14. S. Guha and S. Khuller, Improved methods for approximating node weighted Steiner trees and connected dominating sets, Information and Computation 150:57-74, 1999. Earlier version in FST&TCS 1998.
15. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, Journal of Computer and System Sciences 67(3):473-496, 2003. Earlier version in STOC 1999.
16. E. Hazan, S. Safra, and O. Schwartz, On the hardness of approximating k-dimensional matching, Electronic Colloqium on Computational Complexity, Rep. No. 20, 2003.
17. K. Jain, M. Mahdian, and M.R. Salavatipour, Packing Steiner trees, Proc. SODA 2003, pp. 266-274.
18. V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters 37:27-35, 1991.
19. P. Kaski, Packing Steiner trees with identical terminal sets, Information Processing Letters 91(1):1-5, 2004.
20. P.N. Klein and R. Ravi, A nearly best-possible approximation algorithm for node-weighted Steiner trees. Journal of Algorithms 19(1): 104-114, 1995.
21. S.G. Kolliopoulos and C. Stein, Approximating disjoint-path problems using packing integer programs, Mathematical Programming 99:63-87, 2004. Earlier version in Proc. IPCO 1998.
22. M. Kriesell, Edge-disjoint trees containing some given vertices in a graph, Journal of Combinatorial Theory. Series B 88:53-65, 2003.
23. L. Lau, An approximate max-Steiner-tree-packing min-Steiner-cut theorem, Proc. 45th IEEE FOCS, pp. 61-70, 2004.
24. A. Martin and R. Weismantel, Packing paths and Steiner trees: routing of electronic circuits, CWI Quarterly 6:185-204, 1993.
25. S. Vempala, and B. Vöcking, Approximating multicast congestion, Proc. 10th ISAAC, Chennai, pp. 367-372, LNCS 1741, Springer, Berlin, 1999.