Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs

DOI10.1137/1.9781611973402.124MaRDI QIDQ5384086zbMATH OpenOpenAlexFDO

Authors Wang-Chi Cheung, Michel X. Goemans, Sam Chiu-wai Wong

Publication date 20 June 2019

Published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973402.124

Mathematics Subject Classification ID

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

Recommendations

• Tight algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
• Set cover revisited: hypergraph cover with hard capacities
• Tight approximation for partial vertex cover with hard capacities
• Tight approximation for partial vertex cover with hard capacities
• An improved approximation algorithm for vertex cover with hard capacities

Cited in

(14)

• O(f) bi-criteria approximation for capacitated covering with hard capacities
• Approximation algorithm for vertex cover with multiple covering constraints
• Iterative partial rounding for vertex cover with hard capacities
• Tight approximation for partial vertex cover with hard capacities
• An improved approximation algorithm for vertex cover with hard capacities
• Set cover revisited: hypergraph cover with hard capacities
• scientific article; zbMATH DE number 2038708 (Why is no real title available?)
• Tight algorithms for vertex cover with hard capacities on multigraphs and hypergraphs
• Iterative partial rounding for vertex cover with hard capacities
• O(f) bi-approximation for capacitated covering with hard capacities
• Approximation algorithm for vertex cover with multiple covering constraints
• Tight approximation for partial vertex cover with hard capacities
• Parameterized certificate dispersal and its variants
• FPT approximation using treewidth: capacitated vertex cover, target set selection and vector dominating set

This page was built for publication: Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384086)