scientific article; zbMATH DE number 1263202
From MaRDI portal
Publication:4234073
Recommendations
Cited in
(35)- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Rounding algorithms for covering problems
- Two sensitivity theorems in fuzzy integer programming.
- Theoretical complexity of grid cover problems used in radar applications
- A fuzzy genetic algorithm for driver scheduling
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
- Scheduling split intervals with non-uniform demands
- On interval and circular-arc covering problems
- Approximation of the quadratic set covering problem
- Approximating the online set multicover problems via randomized winnowing
- Tight approximability results for test set problems in bioinformatics
- Improved approximation algorithms for rectangle tiling and packing.
- New approaches to covering and packing problems
- Shrinking maxima, decreasing costs: new online packing and covering problems
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
- scientific article; zbMATH DE number 6719727 (Why is no real title available?)
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
- scientific article; zbMATH DE number 1241839 (Why is no real title available?)
- Approximation of optima of integer programs of the packing—covering type
- On dependent randomized rounding algorithms
- scientific article; zbMATH DE number 1830719 (Why is no real title available?)
- scientific article; zbMATH DE number 1839427 (Why is no real title available?)
- Approximation Schemes for Covering and Packing
- Improved Approximation Guarantees for Packing and Covering Integer Programs
- Ranking with Fairness Constraints
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
- Approximation algorithms for a genetic diagnostics problem
- Improved approximation algorithms for box contact representations
- Fixed-parameter tractability of satisfying beyond the number of variables
- Experimental and Efficient Algorithms
- Improved parallel approximation of a class of integer programming problems
- A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4234073)
