Dynamic programming based algorithms for set multicover and multiset multicover problems
From MaRDI portal
Publication:974740
DOI10.1016/J.TCS.2010.02.016zbMATH Open1203.68316OpenAlexW1994289544MaRDI QIDQ974740FDOQ974740
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
Recommendations
- Exact algorithms for set multicover and multiset multicover problems
- Algorithms for the set covering problem
- Problems and algorithms for covering arrays via set covers
- Dynamic set cover: improved algorithms and lower bounds
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover
- Dynamic programming in the problem of optimization of a covering
- Approximation algorithm for the partial set multi-cover problem
- scientific article; zbMATH DE number 3875302
- A heuristic algorithm for the multi-criteria set-covering problems
- Approximation and Online Algorithms
Cites Work
- Title not available (Why is that?)
- A fast approximation algorithm for the multicovering problem
- Title not available (Why is that?)
- Set Partitioning via Inclusion-Exclusion
- Fourier meets M\"{o}bius: fast subset convolution
- Scheduling orders for multiple product types with due date related objectives
- Title not available (Why is that?)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- An improved approximation algorithm for vertex cover with hard capacities
- New approaches to covering and packing problems
- Approximating covering integer programs with multiplicity constraints
- Approximation algorithms for covering/packing integer programs
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- Covering Problems with Hard Capacities
- Sum Multicoloring of Graphs
- Set multi-covering via inclusion-exclusion
- Approximation and Online Algorithms
- Exact Algorithms for Set Multicover and Multiset Multicover Problems
- Structural Information and Communication Complexity
Cited In (6)
- Ad hoc heuristic for the cover printing problem
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules
- The robust minimal controllability problem
- Tight Lower Bounds for the Complexity of Multicoloring
- MLQCC: an improved local search algorithm for the set k‐covering problem
This page was built for publication: Dynamic programming based algorithms for set multicover and multiset multicover problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974740)
