22 search results - page 2 / 5 » Approximating k-hop Minimum Spanning Trees in Euclidean Metr... |
WADS
2005
Springer
14 years 23 days ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
SAC
2003
ACM
14 years 16 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
JUCS
2007
13 years 7 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
PDCAT
2005
Springer
14 years 23 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...