A fast approximation algorithm for the multicovering problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3875302 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A linear-time approximation algorithm for the weighted vertex cover problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
Cited in
(38)- Approximability of sparse integer programs
- Computing Convex Coverage Sets for Faster Multi-objective Coordination
- Randomized approximation for the set multicover problem in hypergraphs
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
- A primal-dual approximation algorithm for generalized Steiner network problems
- Pareto optimality and a class of set covering heuristics
- On the number and arrangement of sensors for the multiple covering of bounded plane domains
- Set multi-covering via inclusion-exclusion
- Randomized approximation of bounded multicovering problems
- A randomised approximation algorithm for the hitting set problem
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- Online multiset submodular cover
- Approximation algorithm for the multicovering problem
- Approximation of the clustered set covering problem
- Admission control with advance reservations in simple networks
- Minimum monopoly in regular and tree graphs
- Rounding algorithms for covering problems
- One for the price of two: a unified approach for approximating covering problems
- Approximation algorithms in combinatorial scientific computing
- Dynamic programming based algorithms for set multicover and multiset multicover problems
- Customer order scheduling to minimize the number of late jobs
- On multiple coverings of fixed size containers with non-Euclidean metric by circles of two types
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost
- Exact algorithms for set multicover and multiset multicover problems
- Heuristic solutions and confidence intervals for the multicovering problem
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings
- LP-based covering games with low price of anarchy
- The multicovering problem
- Pick-and-choose heuristics for partial set covering
- Approximating integer programs with positive right-hand sides
- The multi‐integer set cover and the facility terminal cover problem
- Exact multi-covering problems with geometric sets
- A constant-factor approximation for multi-covering with disks
- Distributed algorithms for covering, packing and maximum weighted matching
- Hyperbolic set covering problems with competing ground-set elements
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
This page was built for publication: A fast approximation algorithm for the multicovering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082267)
