Dependent Rounding and Its Applications to Approximation Algorithms¶
Gandhi, R., Khuller, S., Parthasarathy, S., & Srinivasan, A. (2006). Dependent Rounding and Its Applications to Approximation Algorithms. Journal of the ACM, 53(3), 324-360.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Randomized Rounding
- Dependent rounding handles constraints that independent choices would disrupt by coupling variables while preserving marginals and tightly controlling sums.
This sourceThe primary paper verifies marginal preservation, degree preservation, negative-correlation properties, and multiple approximation-algorithm applications.
- Dependent rounding handles constraints that independent choices would disrupt by coupling variables while preserving marginals and tightly controlling sums.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
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:fe7a1f7699ee · see in the full table