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
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.
Integrity signals
Registry
Cites
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.
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
(1979) · Cited by 43,841
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (1956) · Canadian Journal of Mathematics · doi:10.4153/cjm-1956-045-5 · Cited by 2,410
Maximal Flow Through a Network
Ford, L. R., & Fulkerson, D. R. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_15 · Cited by 1,829
The geometry of graphs and some of its algorithmic applications
Linial, N., London, E., & Rabinovich, Y. (1995) · Combinatorica · doi:10.1007/bf01200757 · Cited by 952
On lipschitz embedding of finite metric spaces in Hilbert space
Bourgain, J. (1985) · Israel Journal of Mathematics · doi:10.1007/bf02776078 · Cited by 560
A note on the maximum flow through a network
Elias, P., Feinstein, A., & Shannon, C. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056816 · Cited by 456
Approximate graph coloring by semidefinite programming
Karger, D., Motwani, R., & Sudan, M. (1998) · Journal of the ACM · doi:10.1145/274787.274791 · Cited by 420
Leighton, T., & Rao, S. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21958 · Cited by 395
.879-approximation algorithms for MAX CUT and MAX 2SAT
Goemans, M. X., & Williamson, D. P. (1994) · Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 · doi:10.1145/195058.195216 · Cited by 234
The complexity of multiway cuts (extended abstract)
Dahlhaus, E., Johnson, D. S., Papadimitriou, C. H., Seymour, P. D., & Yannakakis, M. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129736 · Cited by 221
Cited by
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
Bounded geometries, fractals, and low-distortion embeddings
Gupta, A., Krauthgamer, R., & Lee, J. R. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238226 · Cited by 405
Expander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007355 · Cited by 297
Khot, S. A., & Vishnoi, N. K. (2005) · 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05) · doi:10.1109/sfcs.2005.74 · Cited by 263
Modularity clustering is force-directed layout
Noack, A. (2009) · Physical Review E · doi:10.1103/physreve.79.026102 · Cited by 258
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.