Packing Steiner trees with identical terminal sets

Information Processing Letters

Volumn 91, Issue 1, 2004, Pages 1-5

  Kaski, Petteri ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Combinatorial problems; Computational complexity; NP completeness; Steiner tree packing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

COMBINATORIAL PROBLEMS; NP-COMPLETENESS; STEINER TREE PACKING; TERMINAL NODES;

DATA PROCESSING;

EID: 2642585758     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.03.006     Document Type: Article

References (11)

1. Floréen P., Kaski P., Kohonen J., Orponen P. Multicast time maximization in energy constrained wireless networks. Proc. 2003 Joint Workshop on Foundations of Mobile Computing (DIALM-POMC'03). 2003;50-58 ACM, New York.
2. Frank A., Király T., Kriesell M. On decomposing a hypergraph into k connected sub-hypergraphs. Discrete Appl. Math. 131:2003;373-383.
3. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness. 1979;Freeman, San Francisco, CA.
4. Grötschel M., Lovász L., Schrijver A. Geometric Algorithms and Combinatorial Optimization. second ed. 1993;Springer-Verlag, Berlin.
5. Grötschel M., Martin A., Weismantel R. The Steiner tree packing problem in VLSI design. Math. Programming. 78:1997;265-281.
6. Jain K., Mahdian M., Salavatipour M.R. Packing Steiner trees. Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA'03). 2003;266-274 ACM, New York.
7. Korte B., Prömel H.J., Steger A. Steiner trees in VLSI-layout. Korte B., Lovász L., Prömel H. Paths, Flows, and VLSI-layout. 1990;185-214 Springer-Verlag, Berlin.
8. Kriesell M. Edge-disjoint trees containing some given vertices in a graph. J. Combin. Theory Ser. B. 88:2003;53-65.
9. Papadimitriou C. Computational Complexity. 1994;Addison-Wesley, Reading, MA.
10. Schaefer T.J. The complexity of satisfiability problems. Proc. 10th ACM Symposium on Theory of Computing (STOC'78). 1978;216-226 ACM, New York.
11. Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency, vols. A,B,C. 2003;Springer-Verlag, Berlin.