Random Sampling and Randomized Rounding of Linear Programs¶
Williamson, D. P., & Shmoys, D. B. (2011). Random Sampling and Randomized Rounding of Linear Programs. The Design of Approximation Algorithms.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Randomized Rounding
- If conditional expectations or pessimistic estimators can be computed, the random choices can often be fixed deterministically without worsening the guarantee.
This sourceThe authoritative textbook chapter supports the LP-rounding family, expected guarantees, applications, and conditional-expectation derandomization boundary.
- If conditional expectations or pessimistic estimators can be computed, the random choices can often be fixed deterministically without worsening the 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.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:4a9ba10a5591 · see in the full table