Sciweavers

246 search results - page 2 / 50
» A Constant Factor Approximation Algorithm for Fault-Tolerant...
Sort
View
MOBIHOC
2008
ACM
14 years 4 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
14 years 1 months ago
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnasw...
FOCS
2002
IEEE
13 years 9 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
STOC
2003
ACM
119views Algorithms» more  STOC 2003»
14 years 4 months ago
Constant factor approximation of vertex-cuts in planar graphs
Eyal Amir, Robert Krauthgamer, Satish Rao