Set Cover Revisited: Hypergraph Cover with Hard Capacities

DOI10.1007/978-3-642-31594-7_64zbMath1272.68463OpenAlexW1840962598MaRDI QIDQ2843299

Samir Khuller, Barna Saha

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31594-7_64

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

Tight approximation for partial vertex cover with hard capacities ⋮ Tight approximation for partial vertex cover with hard capacities ⋮ Iterative partial rounding for vertex cover with hard capacities ⋮ A model for minimizing active processor time ⋮ \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities

This page was built for publication: Set Cover Revisited: Hypergraph Cover with Hard Capacities