Exact algorithms for set multicover and multiset multicover problems
From MaRDI portal
Recommendations
- Dynamic programming based algorithms for set multicover and multiset multicover problems
- Set multi-covering via inclusion-exclusion
- A fast approximation algorithm for the multicovering problem
- Approximation and Online Algorithms
- Approximation algorithm for partial set multicover versus full set multicover
Cited in
(19)- A novel decomposition approach to set covering problems by exploiting special structures
- Set multi-covering via inclusion-exclusion
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
- A fast approximation algorithm for the multicovering problem
- Robust multicovers with budgeted uncertainty
- Tight approximation bounds for maximum multi-coverage
- On constrained minimum weight edge covers with applications to emergency planning
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems
- Dynamic programming based algorithms for set multicover and multiset multicover problems
- An exact algorithm for the maximal covering problem
- The robust minimal controllability problem
- On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts
- Hardness and algorithms for electoral manipulation under media influence
- Polynomial-time algorithms for regular set-covering and threshold synthesis
- The \textsc{Exact Subset MultiCover} problem
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- On nonlinear multi-covering problems
- The Exact Subset MultiCover problem
- A variable neighborhood search algorithm for the multimode set covering problem
This page was built for publication: Exact 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 Q3652189)
