Dynamic programming based algorithms for set multicover and multiset multicover problems
From MaRDI portal
Publication:974740
DOI10.1016/j.tcs.2010.02.016zbMath1203.68316OpenAlexW1994289544MaRDI QIDQ974740
Qiang-Sheng Hua, Francis C. M. Lau, Dongxiao Yu, Yuexuan Wang
Publication date: 7 June 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10722/65464
Related Items (5)
The robust minimal controllability problem ⋮ Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules ⋮ MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ Ad hoc heuristic for the cover printing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Set multi-covering via inclusion-exclusion
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- A fast approximation algorithm for the multicovering problem
- Approximating covering integer programs with multiplicity constraints
- Scheduling orders for multiple product types with due date related objectives
- Approximation algorithms for covering/packing integer programs
- An improved approximation algorithm for vertex cover with hard capacities
- Covering Problems with Hard Capacities
- Fourier meets M\"{o}bius: fast subset convolution
- Set Partitioning via Inclusion-Exclusion
- Exact Algorithms for Set Multicover and Multiset Multicover Problems
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Sum Multicoloring of Graphs
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- Structural Information and Communication Complexity
- Approximation and Online Algorithms
This page was built for publication: Dynamic programming based algorithms for set multicover and multiset multicover problems
