Rounding algorithms for covering problems
From MaRDI portal
Recommendations
Cites work
- A fast approximation algorithm for the multicovering problem
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time approximation algorithm for the weighted vertex cover problem
- A primal-dual approximation algorithm for generalized Steiner network problems
- A Selection Problem of Shared Fixed Costs and Network Flows
- A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers
- Approximation algorithms for combinatorial problems
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Heuristics for the fixed cost median problem
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 3769673 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 1263260 (Why is no real title available?)
- scientific article; zbMATH DE number 1263278 (Why is no real title available?)
- scientific article; zbMATH DE number 495965 (Why is no real title available?)
- scientific article; zbMATH DE number 742977 (Why is no real title available?)
- On the Greedy Heuristic for Continuous Covering and Packing Problems
- On the hardness of approximating minimization problems
- On the ratio of optimal integral and fractional covers
- Optimization, approximation, and complexity classes
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
Cited in
(28)- The controlled rounding problem: Complexity and computational experience
- On dependent randomized rounding algorithms
- Approximating covering integer programs with multiplicity constraints
- Minimizing average project team size given multi-skilled workers with heterogeneous skill levels
- A branch-and-cut algorithm for the pallet loading problem
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- Approximability of open \(k\)-monopoly problems
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set
- The set covering problem revisited: an empirical study of the value of dual information
- New approaches to covering and packing problems
- Randomized rounding for routing and covering problems: experiments and improvements
- Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
- Geometric rounding: A dependent randomized rounding scheme
- scientific article; zbMATH DE number 1263202 (Why is no real title available?)
- scientific article; zbMATH DE number 1342117 (Why is no real title available?)
- Approximation of optima of integer programs of the packing—covering type
- Approximation algorithms for integer covering problems via greedy column generation
- scientific article; zbMATH DE number 910865 (Why is no real title available?)
- scientific article; zbMATH DE number 1405893 (Why is no real title available?)
- On the number and arrangement of sensors for the multiple covering of bounded plane domains
- Experimental and Efficient Algorithms
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Approximating integer programs with positive right-hand sides
- Distributed algorithms for covering, packing and maximum weighted matching
- LP based heuristics for the multiple knapsack problem with assignment restrictions
- Rounding to an integral program
This page was built for publication: Rounding algorithms for covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380937)
