114 search results - page 19 / 23 » Approximation Algorithms for Unit Disk Graphs |
145
click to vote
MOBICOM
2004
ACM
15 years 9 months ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
132
click to vote
WADS
2005
Springer
15 years 9 months 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...
138
click to vote
PODC
2009
ACM
16 years 4 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
122
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
156
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...