251 search results - page 18 / 51 » Distributed algorithms for edge dominating sets |
110
click to vote
MOBIHOC
2003
ACM
15 years 9 months ago
2003
ACM
The efficiency of a communication network depends not only on its control protocols, but also on its topology. We propose a distributed topology management algorithm that construc...
ATAL
2007
Springer
15 years 1 months ago
2007
Springer
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
APPROX
2007
Springer
15 years 1 months ago
2007
Springer
We study the Steiner Tree problem in the model of two-stage stochastic optimization with non-uniform inflation factors, and give a poly-logarithmic approximation factor for this pr...
101
click to vote
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
JAIR
2007
14 years 9 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...