Hardness and approximation results for packing steiner trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 180-191

  Cheriyan, Joseph ^a   Salavatipour, Mohammad R ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; DIRECTED GRAPHS; HARDNESS;

APPROXIMATION RESULTS; APX-HARDNESS; HARDNESS OF APPROXIMATION; HARDNESS RESULT; NODE-DISJOINT; STEINER; STEINER TREES; UNDIRECTED GRAPH;

TREES (MATHEMATICS);

EID: 33847350325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_18     Document Type: Article

References (21)

1. S.Arora and C.Lund, Hardness of approximations, in Approximation Algorithms for NP-hard Problems, Dorit Hochbaum Ed., PWS Publishing, 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. M.Charikar, C.Chekuri, T.Cheung, Z.Dai, A.Goel, S.Guha, and M.Li, Approximation algorithms for directed Steiner problem, J. Algorithms 33(1):73-91, 1999. Earlier version in SODA 1998.
4. M.Charikar, J.Naor, and B.Schieber, Resource optimization in QoS multicast routing of real-time multimedia, Proc. 19th Annual IEEE INFOCOM (2000).
5. R.Diestel, Graph Theory, Springer, New York, NY, 2000.
6. U.Feige, M.Halldorsson, G.Kortsarz, and A.Srinivasan, Approximating the domatic number, Siam J. Computing 32(1):172-195, 2002. Earlier version in STOC 2000.
7. P.Floréen, P.Kaski, J.Kohonen, and P.Orponen, Multicast time maximization in energy constrained wireless networks, in Proc. 2003 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC 2003), San Diego, CA, 2003.
8. A.Frank, T.Király, M.Kriesell, On decomposing a hypergraph into k connected subhypergraphs, Discrete Applied Mathematics 131(2):373-383, 2003.
9. V.Guruswami, S.Khanna, R.Rajaraman, B.Shepherd, and M.Yannakakis, Nearoptimal hardness results and approximation algorithms for edge-disjoint paths and related problems, J. Computer and System Sciences 67(3):473-496, 2003. Earlier version in STOC 1999.
10. S.Fortune, J.Hopcroft, and J.Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science 10(2):111-121, 1980.
11. M.Grötschel, A.Martin, and R.Weismantel, The Steiner tree packing problem in VLSI design, Mathematical Programming 78:265-281, 1997.
12. 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.
13. E.Hazan, S.Safra, and O.Schwarte, On the hardness of approximating k-dimensional matching, Electronic Colloqium on Computational Complexity, Rep. No. 20, 2003.
14. K.Jain, M.Mahdian, M.R.Salavatipour, Packing Steiner trees, Proc. SODA 2003.
15. V.Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters 37:27-35, 1991.
16. P.Kaski, Packing Steiner trees with identical terminal sets, Information Processing Letters 91(1):1-5, 2004.
17. 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.
18. J.Kratochvil and Z.Tuza, On the complexity of bicoloring clique hypergraphs of graphs, J. Algorithms 45:40-54, 2002. Earlier version in SODA 2000.
19. M.Kriesell, Edge-disjoint trees containing some given vertices in a graph, J. Combinatorial Theory (B) 88:53-65, 2003.
20. L.C.Lau, An approximate max-Steiner-tree-packing min-Steiner-cut theorem, manuscript, 2004.
21. A.Martin and R.Weismantel, Packing paths and Steiner trees: Routing of electronic circuits, CWI Quarterly 6:185-204, 1993.