130 search results - page 16 / 26 » Faster Approximation Algorithms for the Rectilinear Steiner ... |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
SIAMDM
2008
13 years 7 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...