280 search results - page 29 / 56 » Distributed Approximation Algorithms for Planar Graphs |
139
Voted
PDP
2005
IEEE
15 years 7 months ago
2005
IEEE
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
127
click to vote
DCOSS
2006
Springer
15 years 5 months ago
2006
Springer
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
130
Voted
ICDCS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
127
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
137
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...