✦ LIBER ✦

The Online Set Cover Problem

✍ Scribed by Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi)

Book ID: 118180759
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 193 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/060661946

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum-entropy set cover problem

✍ Eran Halperin; Richard M. Karp 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 230 KB

The multi-integer set cover and the faci

The multi-integer set cover and the facility terminal cover problem

✍ Dorit S. Hochbaum; Asaf Levin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

## Abstract The facility terminal cover problem is a generalization of the vertex cover problem. The problem is to “cover” the edges of an undirected graph __G__ = (__V__,__E__) where each edge __e__ is associated with a non‐negative demand __d__~__e__~. An edge __e__ = __u__,__v__ is covered if at

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

The set of parameterized -covers problem

✍ A.A. Gorbenko; V.Yu. Popov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Algorithms for the Set Covering Problem

✍ Alberto Caprara; Paolo Toth; Matteo Fischetti 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 101 KB

On the Positive–Negative Partial Set Cov

On the Positive–Negative Partial Set Cover problem

✍ Pauli Miettinen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 118 KB