114 search results - page 17 / 23 » Approximation Algorithms for Unit Disk Graphs |
111
click to vote
DIALM
2003
ACM
15 years 2 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
ICALP
2011
Springer
14 years 27 days ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
65
Voted
JDA
2007
14 years 9 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 ...
110
click to vote
ISSAC
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. In this paper we derive an algorithm that computes, for a given algebraic hyperelliptic plane curve C of genus p, p > 1, defined by a polynomial y2 = (x−λ1) · · ...