Download:
|
by Kamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour
in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
http://www-math.mit.edu/~mahdian/steiner.ps
Add To MetaCart
Abstract:
The Steiner packing problem is to nd the maximum number of edge-disjoint subgraphs of a given graph G that connect a given set of required points S. This problem is motivated by practical applications in VLSIlayout and broadcasting, as well as theoretical reasons. In this paper, we study this problem and present an algorithm with an asymptotic approximation factor of jSj=4. This gives a sucient condition for the existence of k edge-disjoint Steiner trees in a graph in terms of the edge-connectivity of the graph. We will show that this condition is the best possible if the number of terminals is 3. At the end, we consider the fractional version of this problem, and observe that it can be reduced to the minimum Steiner tree problem via the ellipsoid algorithm. 1
Citations
|
95
|
On the problem of decomposing a graph into n connected factors
– Tutte
- 1961
|
|
73
|
A new greedy approach for facility location problems
– Jain, Mahdian, et al.
- 2002
|
|
45
|
Zur allgemeinen Kurventheorie
– Menger
- 1927
|
|
41
|
The Steiner problem with edge lengths 1
– Bern, Plassmann
- 1989
|
|
29
|
Packing Steiner Trees: A Cutting Plane Algorithm and Computational Results
– Grotschel, Martin, et al.
- 1992
|
|
23
|
Minimum partition of a matroid into independent sets
– Edmonds
- 1965
|
|
21
|
A 1.598 approximation algorithm for the Steiner problem in graphs
– Hougardy, Promel
- 1999
|
|
14
|
Preserving and increasing local edge-connectivity in mixed graphs
– Bang-Jensen, Frank, et al.
- 1995
|
|
13
|
Randomized metarounding
– Carr, Vempala
- 2000
|
|
12
|
Nash-Williams. Edge disjoint spanning trees of finite graphs
– A
- 1961
|
|
11
|
On decomposing a hypergraph into k connected sub-hypergraphs
– Frank, Kir'aly, et al.
- 2003
|
|
7
|
Approximation algorithms for facility location via dual fitting with factor-revealing LP
– Jain, Mahdian, et al.
- 2003
|
|
5
|
Local spanning trees in graphs and hypergraph decomposition with respect to edge-connectivity
– Kriesell
- 1999
|
|
4
|
Network information
– Ahlswede, Cai, et al.
- 2000
|
|
4
|
Packing Paths and Steiner Trees: Routing of Electronic Circuits
– Martin, Weismantel
- 1993
|
|
3
|
Bounds on the maximum number of edge-disjoint steiner trees of a graph
– Petingi, Rodriguez
- 2000
|
|
2
|
The Steiner Tree Packing
– Grotschel, Martin, et al.
- 1997
|
|
1
|
Reconstructing paths. Unpublished manuscript, available online at R. Ravi's homepage
– Conforti, Hassin, et al.
- 1999
|
|
1
|
Beyond rounting: An algebraic approach to network coding
– Koetter, Medard
- 2002
|
|
1
|
Simple algorithms for Steiner trees and paths packing problems in planar graphs
– Wagner
- 1993
|
