74 search results - page 11 / 15 » Approximating the Degree-Bounded Minimum Diameter Spanning T... |
183
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
147
Voted
FSTTCS
2009
Springer
16 years 11 days ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
190
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
144
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
166
Voted
STACS
2010
Springer
16 years 23 days ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...