✦ 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
DOI: 10.1007/s11276-006-3724-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for La

Improved Approximation Algorithms for Label Cover Problems

✍ Moses Charikar; MohammadTaghi Hajiaghayi; Howard Karloff 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 562 KB

Improved Approximation Algorithms for Ge

Improved Approximation Algorithms for Geometric Set Cover

✍ Kenneth L. Clarkson; Kasturi Varadarajan 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 238 KB

Enumerate and Expand: Improved Algorithm

Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover

✍ Daniel Mölle; Stefan Richter; Peter Rossmanith 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 483 KB

Improved Approximation Algorithms for Un

Improved Approximation Algorithms for Uniform Connectivity Problems

✍ 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

Approximation Algorithms for Connected D

Approximation Algorithms for Connected Dominating Sets

✍ S. Guha; S. Khuller 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 140 KB

Approximation Algorithms for Connected D

Approximation Algorithms for Connected Dominating Sets

✍ S. Guha; S. Khuller 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 61 KB