✦ LIBER ✦

Complexity and approximation of the connected set-cover problem

✍ Scribed by Wei Zhang, Weili Wu, Wonjun Lee, Ding-Zhu Du

Book ID: 113071157
Publisher: Springer US
Year: 2011
Tongue: English
Weight: 246 KB
Volume: 53
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-011-9726-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating Node Connectivity Problems

Approximating Node Connectivity Problems via Set Covers

✍ Guy Kortsarz; Zeev Nutov 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 243 KB

A note on ‘Algorithms for connected set

A note on ‘Algorithms for connected set cover problem and fault-tolerant connected set cover problem’

✍ Wei Ren; Qing Zhao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Approximation of the Quadratic Set Cover

Approximation of the Quadratic Set Covering problem

✍ Bruno Escoffier; Peter L. Hammer 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Approximation Algorithms for the Set Cov

Approximation Algorithms for the Set Covering and Vertex Cover Problems

✍ Hochbaum, Dorit S. 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB

Requiring Connectivity in the Set Coveri

Requiring Connectivity in the Set Covering Problem

✍ J. Orestes Cerdeira; Leonor S. Pinto 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 124 KB

Preserving approximation in the Min—Weig

Preserving approximation in the Min—Weighted Set Cover Problem

✍ Giorgio Gambosi; Marco Protasi; Maurizio Talamo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 616 KB

In this paper we prove that the approximate solutions to the Min-Weighted Set Cover Problem provided by Chvatal's algorithm are combinatorially k-stable with respect to element insertions. Intuitively speaking, we define an approximate solution as combinatorially k-stable with respect to an update