Probabilistic Construction of Deterministic Algorithms

Raghavan, P. (1988). Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. Journal of Computer and System Sciences, 37(2), 130-143.

Type

Journal article

Intellectual base

Primary research

Year

1988

Volume

37

Issue

2

Pages

130-143

ISSN

0022-0000

DOI

10.1016/0022-0000(88)90003-7

DOI registrant

Elsevier

Link

https://doi.org/10.1016/0022-0000(88)90003-7

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 primary paper develops deterministic algorithms that mimic randomized-rounding existence proofs through conditional-probability machinery.

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.

Registry ID ref:12f22130eac8 · see in the full table