Sciweavers

8 search results - page 2 / 2
» Efficient Construction of a Bounded Degree Spanner with Low ...
Sort
View
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
14 years 5 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...
INFOCOM
2006
IEEE
13 years 11 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
MOBIHOC
2004
ACM
14 years 4 months ago
Localized algorithms for energy efficient topology in wireless ad hoc networks
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
Wen-Zhan Song, Yu Wang 0003, Xiang-Yang Li