Approximation Algorithms via Randomized Rounding: A Survey¶
Srinivasan, A. (1999). Approximation Algorithms via Randomized Rounding: A Survey: A Survey. Lectures on Approximation and Randomized Algorithms.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Randomized Rounding
- Because the relaxation bounds the unknown discrete optimum, that comparison becomes an approximation guarantee.
This sourceThe survey defines randomized rounding as mapping an efficiently computed relaxation optimum back to a feasible instance solution and reviews correlation inequalities and applications.
- Because the relaxation bounds the unknown discrete optimum, that comparison becomes an approximation guarantee.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:e294e1803e46 · see in the full table