𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved approximation algorithms for connected sensor cover

✍ Scribed by Stefan Funke; Alex Kesselman; Fabian Kuhn; Zvi Lotker; Michael Segal


Publisher
Springer
Year
2006
Tongue
English
Weight
536 KB
Volume
13
Category
Article
ISSN
1022-0038

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Improved Approximation Algorithms for Un
✍ Samir Khuller; Balaji Raghavachari πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 174 KB

The problem of finding minimum-weight spanning subgraphs with a given connectivity requirement is considered. The problem is NP-hard when the connectivity requirement is greater than one. Polynomial time approximation algorithms for various weighted and unweighted connectivity problems are given. Th