Construct · 1 fields · 1 citations

multicommodity flow-cut gap: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph algorithms

the result that the ratio between minimum sparsest cut and maximum concurrent multicommodity flow is at most logarithmic.

In graph algorithms, multicommodity flow-cut gap refers to the result that the ratio between minimum sparsest cut and maximum concurrent multicommodity flow is at most logarithmic. This meaning comes from Leighton (1999) in Journal of the ACM.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how multicommodity flow-cut gap sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

flow6 names · 12 citationsjangle · five names, one experience, partly

References

Leighton, T., & Rao, S. (1999). Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6), 787-832. https://doi.org/10.1145/331524.331526

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct