Sciweavers

7930 search results - page 179 / 1586
» Greedy in Approximation Algorithms
Sort
View
ALGOSENSORS
2009
Springer
16 years 1 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal
TCS
2008
15 years 6 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh
STOC
2005
ACM
81views Algorithms» more  STOC 2005»
16 years 7 months ago
Improved approximation algorithms for minimum-weight vertex separators
Uriel Feige, Mohammad Taghi Hajiaghayi, James R. L...