The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
A Fast Parametric Maximum Flow Algorithm and Applications
Abstract
The classical maximum flow problem sometimes occurs in settings in which the arc capacities are not fixed but are functions of a single parameter, and the goal is to find the value of the parameter such that the corresponding maximum flow or minimum cut satisfies some side condition. Finding the desired parameter value requires solving a sequence of related maximum flow problems. In this paper it is shown that the recent maximum flow algorithm of Goldberg and Tarjan can be extended to solve an important class of such parametric maximum flow problems, at the cost of only a constant factor in its worst-case time bound. Faster algorithms for a variety of combinatorial optimization problems follow from the result.
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
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
On Nonlinear Fractional Programming
Dinkelbach, W. (1967) · Management Science · doi:10.1287/mnsc.13.7.492 · Cited by 3,139
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Self-citationA new approach to the maximum-flow problem
Goldberg, A. V., & Tarjan, R. E. (1988) · Journal of the ACM · doi:10.1145/48014.61051 · Cited by 1,882
Self-citationSelf-adjusting binary search trees
Sleator, D. D., & Tarjan, R. E. (1985) · Journal of the ACM · doi:10.1145/3828.3835 · Cited by 1,228
Self-citationA data structure for dynamic trees
Sleator, D. D., & Tarjan, R. E. (1983) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(83)90006-5 · Cited by 1,018
Self-citationCombinatorial Optimization with Rational Objective Functions
Megiddo, N. (1979) · Mathematics of Operations Research · doi:10.1287/moor.4.4.414 · Cited by 473
Decomposition of Finite Graphs Into Forests
Nash‐Williams, C. S. J. A. (1964) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-39.1.12 · Cited by 459
Minimum partition of a matroid into independent subsets
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.004 · Cited by 444
Algorithm for solution of a problem of maximum flow in networks with power estimation
Dinic, E. A. (1970) · Medical Entomology and Zoology · Cited by 389
Research works printed but not linked: 6
- R. K. Ahuja, J. B. Orlin, A fast and simple algorithm for the maximum flow problem, Working Paper, 1905-87, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA, 1987
- Dinic E. A., 1970, Dokl. Akad. Nauk SSSR, 194, 754
- Ford, Jr. L. R., 1962, Flows in networks
- Gondran Michel, 1984, Graphs and algorithms
- Picard J. C., 1982, INFOR, 20, 394
- Ritter K., 1962, Unter-nehmensforschung, 6, 149
Cited by
Reachability and Distance Queries via 2-Hop Labels
Cohen, E., Halperin, E., Kaplan, H., & Zwick, U. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539702403098 · Cited by 518
Metadata
- Authors
- Gallo, G., Grigoriadis, M. D., & Tarjan, R. E.
- Venue
- SIAM Journal on Computing
- Published
- 1989-02
- Volume
- 18
- Issue
- 1
- Pages
- 30-55
- ISSN
- 0097-5397
- 1095-7111
- Cited by
- 427
- References
- 39
- Language
- en
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
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.
