๐”– Bobbio Scriptorium
โœฆ   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

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
โœ 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

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