Exact Algorithms for Set Multicover and Multiset Multicover Problems

DOI10.1007/978-3-642-10631-6_6zbMath1272.68334OpenAlexW8558823MaRDI QIDQ3652189

Dongxiao Yu, Yuexuan Wang, Francis C. M. Lau, Qiang-Sheng Hua

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Tight Approximation Bounds for Maximum Multi-coverage, The robust minimal controllability problem, A variable neighborhood search algorithm for the multimode set covering problem, The Exact Subset MultiCover problem, Hardness and algorithms for electoral manipulation under media influence, On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts, Robust multicovers with budgeted uncertainty, Dynamic programming based algorithms for set multicover and multiset multicover problems, Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting