60 search results - page 2 / 12 » Construction of Minimum-Weight Spanners |
COMGEO
2002
ACM
13 years 7 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
ADHOCNOW
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present a streaming algorithm for constructing sparse spanners and show that our algorithm out-performs significantly the state-of-the-art algorithm for this task [20]. Speci...