Sciweavers

13214 search results - page 293 / 2643
» Pseudorandomness for network algorithms
Sort
View
ICWN
2004
15 years 8 months ago
A Distributed Clustering Framework in Mobile Ad Hoc Networks
Abstract-- In this paper, we present a completely distributed algorithm for partitioning a given set of mobile nodes into clusters. The proposed algorithm tries to reduce the amoun...
Mohit Garg, R. K. Shyamasundar
SODA
2000
ACM
78views Algorithms» more  SODA 2000»
15 years 8 months ago
Strengthening integrality gaps for capacitated network design and covering problems
Robert D. Carr, Lisa Fleischer, Vitus J. Leung, Cy...
WASA
2010
Springer
212views Algorithms» more  WASA 2010»
15 years 5 months ago
Interference-Aware Gossiping Scheduling in Uncoordinated Duty-Cycled Multi-hop Wireless Networks
Xianlong Jiao, Wei Lou, Xiaodong Wang, Junchao Ma,...
IWOCA
2010
Springer
185views Algorithms» more  IWOCA 2010»
15 years 1 months ago
Efficient Connectivity Testing of Hypercubic Networks with Faults
Tomás Dvorák, Jirí Fink, Petr...