The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
Abstract
A multicommodity flow problem is considered where for each pair of vertices (u, v) it is required to send f half-units of commodity (u, v) from u to v and f half-units of commodity (v, u) from v to u without violating capacity constraints. The main result is an algorithm for performing the task provided that the capacity of each cut exceeds the demand across the cut by a Theta (log n) factor. The condition on cuts is required in the worst case, and is trivially within a Theta (log n) factor of optimal for any flow problem. The result can be used to construct the first polylog-times optimal approximation algorithms for a wide variety of problems, including minimum quotient separators, 1/3-2/3 separators, bifurcators, crossing number, and VLSI layout area. It can also be used to route packets efficiently in arbitrary distributed networks.>
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
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Davidson, G. W., & Crase, D. (1989) · Death Studies · doi:10.1080/07481188908252281 · Cited by 2,848
A Linear-Time Heuristic for Improving Network Partitions
Fiduccia, C. M., & Mattheyses, R. M. (1982) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.1982.1585498 · Cited by 2,567
A framework for solving VLSI graph layout problems
Bhatt, S. N., & Leighton, F. T. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90071-0 · Cited by 438
Tight Bounds on the Complexity of Parallel Sorting
Leighton, T. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.5009385 · Cited by 368
Self-citationGraph bisection algorithms with good average case behavior
Bui, T. N., Chaudhuri, S., Leighton, F. T., & Sipser, M. (1987) · Combinatorica · doi:10.1007/bf02579448 · Cited by 323
Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks
Leighton, F. T. (2003) · Medical Entomology and Zoology · Cited by 128
Cited by
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
The Design of Approximation Algorithms
Williamson, D. P., & Shmoys, D. B. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921735 · Cited by 1,301
New spectral methods for ratio cut partitioning and clustering
Hagen, L., & Kahng, A. B. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.159993 · Cited by 1,288
Local Graph Partitioning using PageRank Vectors
Andersen, R., Chung, F., & Lang, K. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.44 · Cited by 967
Feige, U., Peleg, D., & Kortsarz, G. (2001) · Algorithmica · doi:10.1007/s004530010050 · Cited by 592
Metadata
- Authors
- Leighton, T., & Rao, S.
- Venue
- [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 1988
- Pages
- 422-431
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2125278290
- Cited by
- 395
- References
- 7
- FWCI
- 5.99
- Type
- conference paper
- 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 approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. https://app.cochat.ai/papers/10.1109/sfcs.1988.21958
- The paper
- Leighton, T., & Rao, S. (1988). An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1988.21958
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.
