Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 260

The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.

An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm

Aumann, Yonatan, Rabani, Yuval·1998·SIAM Journal on Computing

Abstract

It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This improves upon the previously best-known bound of O(log 2 k ) and is existentially tight, up to a constant factor. An algorithm for finding a cut with ratio within a factor of O(log k) of the maximum concurrent flow, and thus of the optimal min-cut ratio, is presented.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s0097539794285983

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 15 references

Cited by

See all 260

Metadata

Authors
Aumann, Y., & Rabani, Y.
Venue
SIAM Journal on Computing
Published
1998-02
Volume
27
Issue
1
Pages
291-301
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2107881198
Cited by
260
References
15
FWCI
5.02
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. https://app.cochat.ai/papers/10.1137/s0097539794285983
The paper
Aumann, Y., & Rabani, Y. (1998). An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM Journal on Computing. https://doi.org/10.1137/s0097539794285983

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.