Packing Steiner trees with identical terminal sets

Authors:
Petteri Kaski
Affiliations:
Laboratory for Theoretical Computer Science, Department of Computer Science and Engineering, Helsinki University of Technology, P.O. Box 5400, FI-02015 HUT, Finland
Venue:
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Year:
2004

The Steiner tree packing problem in VLSI design

Mathematical Programming: Series A and B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Packing Steiner trees

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Edge-disjoint trees containing some given vertices in a graph

Journal of Combinatorial Theory Series B
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Multicast time maximization in energy constrained wireless networks

DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
On decomposing a hypergraph into k connected sub-hypergraphs

Discrete Applied Mathematics - Submodularity

Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Hi-index	0.07