The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.
Linear-Time Approximation for Maximum Weight Matching
Abstract
The maximum cardinality and maximum weight matching problems can be solved in Õ ( m √ n ) time, a bound that has resisted improvement despite decades of research. (Here m and n are the number of edges and vertices.) In this article, we demonstrate that this “ m √ n barrier” can be bypassed by approximation. For any ε > 0, we give an algorithm that computes a (1 − ε )-approximate maximum weight matching in O ( mε −1 log ε −1 ) time, that is, optimal linear time for any fixed ε . Our algorithm is dramatically simpler than the best exact maximum weight matching algorithms on general graphs and should be appealing in all applications that can tolerate a negligible relative error.
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
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Algorithms for the Assignment and Transportation Problems
Munkres, J. (1957) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0105003 · Cited by 3,986
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Fibonacci heaps and their uses in improved network optimization algorithms
Fredman, M. L., & Tarjan, R. E. (1987) · Journal of the ACM · doi:10.1145/28869.28874 · Cited by 2,656
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Edmonds, J., & Karp, R. M. (1972) · Journal of the ACM · doi:10.1145/321694.321699 · Cited by 2,528
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Contributions to the theory of games.
(1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90366-5 · Cited by 1,824
Maximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712
The Distribution of a Product from Several Sources to Numerous Localities
Hitchcock, F. L. (1941) · Journal of Mathematics and Physics · doi:10.1002/sapm1941201224 · Cited by 1,609
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
The iSLIP scheduling algorithm for input-queued switches
McKeown, N. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.769767 · Cited by 1,185
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Christofides, N. (2022) · Operations Research Forum · doi:10.1007/s43069-021-00101-z · Cited by 1,131
Matching, Euler tours and the Chinese postman
Edmonds, J., & Johnson, E. L. (1973) · Mathematical Programming · doi:10.1007/bf01580113 · Cited by 980
High-speed switch scheduling for local-area networks
Anderson, T. E., Owicki, S. S., Saxe, J. B., & Thacker, C. P. (1993) · ACM Transactions on Computer Systems · doi:10.1145/161541.161736 · Cited by 892
Ford, L. R., & Fulkerson, D. R. (1963) · Princeton University Press eBooks · doi:10.1515/9781400875184 · Cited by 891
A General Approximation Technique for Constrained Forest Problems
Goemans, M. X., & Williamson, D. P. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539793242618 · Cited by 884
Multiplying matrices faster than coppersmith-winograd
Williams, V. V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214056 · Cited by 850
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
Micali, S., & Vazirani, V. V. (1980) · 21st Annual Symposium on Foundations of Computer Science (sfcs 1980) · doi:10.1109/sfcs.1980.12 · Cited by 822
1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem
Neumann, J. V. (1953) · Contributions to the Theory of Games (AM-28), Volume II · doi:10.1515/9781400881970-002 · Cited by 483
Faster Scaling Algorithms for Network Problems
Gabow, H. N., & Tarjan, R. E. (1989) · SIAM Journal on Computing · doi:10.1137/0218069 · Cited by 414
Data structures for weighted matching and nearest common ancestors with linking
Gabow, H. N. (1990) · Symposium on Discrete Algorithms · doi:10.5555/320176.320229 · Cited by 398
Finding a Maximum Cut of a Planar Graph in Polynomial Time
Hadlock, F. (1975) · SIAM Journal on Computing · doi:10.1137/0204019 · Cited by 389
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
Variants of the hungarian method for assignment problems
Kuhn, H. W. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030404 · Cited by 386
Application of the simplex method to a transportation problem
Dantzig, G. B. (1951) · Medical Entomology and Zoology · Cited by 375
Faster scaling algorithms for general graph matching problems
Gabow, H. N., & Tarjan, R. E. (1991) · Journal of the ACM · doi:10.1145/115234.115366 · Cited by 301
A new algorithm for the assignment problem
Bertsekas, D. P. (1981) · Mathematical Programming · doi:10.1007/bf01584237 · Cited by 292
Maximum Matchings via Gaussian Elimination
Mucha, M., & Sankowski, P. (2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.40 · Cited by 268
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
Preis, R. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49116-3_24 · Cited by 237
A survey of heuristics for the weighted matching problem
Avis, D. (1983) · Networks · doi:10.1002/net.3230130404 · Cited by 203
Scaling algorithms for network problems
Garbow, H. N. (1985) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(85)90039-x · Cited by 199
A primal algorithm for optimum matching
Cunningham, W. H., & Marsh, A. B. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0121194 · Cited by 163
A simple approximation algorithm for the weighted matching problem
Drake, D. E., & Hougardy, S. (2003) · Information Processing Letters · doi:10.1016/s0020-0190(02)00393-9 · Cited by 146
Vazirani, V. V. (1994) · COMBINATORICA · doi:10.1007/bf01305952 · Cited by 141
An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
Galil, Z., Micali, S. M., & Gabow, H. N. (1986) · SIAM Journal on Computing · doi:10.1137/0215009 · Cited by 129
A new pivoting strategy for Gaussian elimination
Olschowka, M., & Neumaier, A. (1996) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)00192-8 · Cited by 126
A scaling algorithm for weighted matching on general graphs
Gabow, H. N. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.3 · Cited by 108
Distributed Evolutionary Graph Partitioning
Sanders, P. W., & Schulz, C. (2012) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611972924.2 · Cited by 100
Thorup, M. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780542.780566 · Cited by 87
Algebraic Algorithms for Matching and Matroid Problems
Harvey, N. J. A. (2009) · SIAM Journal on Computing · doi:10.1137/070684008 · Cited by 68
Approximating Maximum Weight Matching in Near-Linear Time
Duan, R., & Pettie, S. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.70 · Cited by 62
Self-citationEasterfield, T. E. (1946) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-21.3.219 · Cited by 60
The Problem of Classification of Personnel
Thorndike, R. L. (1950) · Psychometrika · doi:10.1007/bf02289039 · Cited by 58
Maximum weight bipartite matching in matrix multiplication time
Sankowski, P. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.07.028 · Cited by 56
A scaling algorithm for maximum weight matching in bipartite graphs
Duan, R., & Su, H.-H. (2012) · Cited by 53
Self-citationAn Approach to the Problem of Differential Prediction
Brogden, H. E. (1946) · Psychometrika · doi:10.1007/bf02289295 · Cited by 48
Motzkin, T. S. (1956) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/006/0090480 · Cited by 22
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Huang, C.-C., & Kavitha, T. (2012) · Cited by 18
A simple reduction from maximum weight matching to maximum cardinality matching
Pettie, S. (2012) · Information Processing Letters · doi:10.1016/j.ipl.2012.08.010 · Cited by 16
Self-citation
Cited by
Machine learning: Trends, perspectives, and prospects
Jordan, M. I., & Mitchell, T. M. (2015) · Science · doi:10.1126/science.aaa8415 · Cited by 9,955
The Ethics of AI Ethics -- An Evaluation of Guidelines
Hagendorff, T. (2019) · arXiv · doi:10.48550/arxiv.1903.03425 · Cited by 1,907
Spec2Vec: Improved mass spectral similarity scoring through learning of structural relationships
Huber, F., Ridder, L., Verhoeven, S., Spaaks, J. H., Diblen, F., Rogers, S., & van der Hooft, J. J. J. (2021) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1008724 · Cited by 255
A survey of local differential privacy for securing internet of vehicles
Zhao, P., Zhang, G., Wan, S., Liu, G., & Umer, T. (2020) · The Journal of Supercomputing · doi:10.1007/s11227-019-03104-0 · Cited by 66
Metadata
- Authors
- Duan, R., & Pettie, S.
- Venue
- Journal of the ACM
- Published
- 2014-01
- Volume
- 61
- Issue
- 1
- Pages
- 1-23
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2047281923
- Cited by
- 265
- References
- 53
- FWCI
- 24.12
- 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
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.