42 search results - page 8 / 9 » Approximating Minimum Max-Stretch spanning Trees on unweight... |
WADS
2007
Springer
13 years 11 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
JOIN
2007
13 years 5 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
JACM
2000
13 years 5 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
JDA
2007
13 years 5 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...