Set cover revisited: hypergraph cover with hard capacities
From MaRDI portal
Publication:2843299
Recommendations
- Covering Problems with Hard Capacities
- Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
- An improved approximation algorithm for vertex cover with hard capacities
- scientific article; zbMATH DE number 2038708
- Tight approximation for partial vertex cover with hard capacities
Cited in
(9)- Tight approximation for partial vertex cover with hard capacities
- Iterative partial rounding for vertex cover with hard capacities
- \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities
- Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
- On capacitated set cover problems
- Covering Problems with Hard Capacities
- \(O(f)\) bi-approximation for capacitated covering with hard capacities
- The multi‐integer set cover and the facility terminal cover problem
- Tight approximation for partial vertex cover with hard capacities
This page was built for publication: Set cover revisited: hypergraph cover with hard capacities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843299)