ALGORITHMICA

2006

13 years 11 months ago
2006

Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...

DC

2010

13 years 11 months ago
2010

We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...

CCCG

2008

14 years 8 days ago
2008

We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...

DCOSS

2008

Springer

14 years 17 days ago
2008

Springer

We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...

IPPS

2002

IEEE

14 years 3 months ago
2002

IEEE

In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efﬁciently for wireless ad hoc networks. It maintains a li...

ICDCS

2002

IEEE

14 years 3 months ago
2002

IEEE

Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efﬁciently in a distributed manner. It integrates the connected dominating se...

DIALM

2003

ACM

14 years 4 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...

WG

2004

Springer

14 years 4 months ago
2004

Springer

A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...

ESA

2004

Springer

14 years 4 months ago
2004

Springer

Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...

WADS

2007

Springer

14 years 4 months ago
2007

Springer

We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...