Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms

Leighton, T., & Rao, S. (1999). Multicommodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms. ACM, 46(6), 787-832.

Type

Journal article

Intellectual base

Primary research

Year

1999

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Multi-commodity flow problem
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

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:aefa9e71b03d · see in the full table