On dependent randomized rounding algorithms
- 1 April 1999
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 24 (3) , 105-114
- https://doi.org/10.1016/s0167-6377(99)00010-3
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Rounding algorithms for covering problemsMathematical Programming, 1998
- Instant recognition of half integrality and 2-approximationsPublished by Springer Nature ,1998
- Nonlinear formulations and improved randomized approximation algorithms for multicut problemsPublished by Springer Nature ,1995
- The Minimum Satisfiability ProblemSIAM Journal on Discrete Mathematics, 1994
- An approximation algorithm for the generalized assignment problemMathematical Programming, 1993
- Combinatorial Optimization: A Tour d’HorizonPublished by Springer Nature ,1993
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987
- Unimodular functionsDiscrete Applied Mathematics, 1986
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- Bin packing can be solved within 1 + ε in linear timeCombinatorica, 1981