Dynamic programming based algorithms for set multicover and multiset multicover problems
From MaRDI portal
(Redirected from Publication:974740)
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
- scientific article; zbMATH DE number 1305389 (Why is no real title available?)
- scientific article; zbMATH DE number 1330032 (Why is no real title available?)
- A fast approximation algorithm for the multicovering problem
- An improved approximation algorithm for vertex cover with hard capacities
- Approximating covering integer programs with multiplicity constraints
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for covering/packing integer programs
- Approximation and Online Algorithms
- Covering Problems with Hard Capacities
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- Exact algorithms for set multicover and multiset multicover problems
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Fourier meets M\"{o}bius: fast subset convolution
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- New approaches to covering and packing problems
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Scheduling orders for multiple product types with due date related objectives
- Set multi-covering via inclusion-exclusion
- Set partitioning via inclusion-exclusion
- Structural Information and Communication Complexity
- Sum Multicoloring of Graphs
Cited in
(9)- The \textsc{Exact Subset MultiCover} problem
- Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules
- Ad hoc heuristic for the cover printing problem
- The robust minimal controllability problem
- MLQCC: an improved local search algorithm for the set k‐covering problem
- Tight lower bounds for the complexity of multicoloring
- Exact algorithms for set multicover and multiset multicover problems
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Set multi-covering via inclusion-exclusion
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)
