Randomized Rounding

Raghavan, P., & Tompson, C. D. (1987). Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs. Combinatorica, 7(4), 0-1.

Type

Journal article

Intellectual base

Primary research

Year

1987

DOI

10.1007/bf02579324

Link

https://doi.org/10.1007/BF02579324

Cited by

1 citation across 1 artifact.

Domain-specific

• Randomized Rounding
  • 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.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://www.cs.auckland.ac.nz/~cthombor/Pubs/RandomRounding/RandomRounding1987.pdf ×1

Registry ID ref:3f2e5435688a · see in the full table