119 search results - page 5 / 24 » Linear-Time Algorithms for Parametric Minimum Spanning Tree ... |
WADS
2005
Springer
14 years 28 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...
IFIP
2004
Springer
14 years 25 days ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
ICALP
2004
Springer
14 years 25 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...