On the public citation graph

Approximate minimum weight matching on points ink-dimensional space

https://doi.org/10.1007/bf01553909
0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230130404openalex-snapshot
A survey of heuristics for the weighted matching problem
inferredcites →https://doi.org/10.1016/0196-6774(84)90024-5openalex-snapshot
Heuristic matching for graphs satisfying the triangle inequality
inferredcites →https://doi.org/10.1109/sfcs.1983.16openalex-snapshot
Fast algorithms for the all nearest neighbors problem
inferredcites →https://doi.org/10.1109/sfcs.1985.3openalex-snapshot
A scaling algorithm for weighted matching on general graphs
inferredcites →https://doi.org/10.1109/sfcs.1986.8openalex-snapshot
An optimal algorithm for the all-nearest-neighbors problem
inferredcites →https://doi.org/10.1137/0212008openalex-snapshot
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/321941.321942openalex-snapshot
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
inferredcites →https://doi.org/10.1145/356924.356930openalex-snapshot
The Quadtree and Related Hierarchical Data Structures
inferredcites →https://doi.org/10.1145/800057.808699openalex-snapshot
Fast expected-time and approximation algorithms for geometric minimum spanning trees
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-63248-4_5openalex-snapshot
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferred← citeshttps://doi.org/10.1007/978-3-031-81396-2_6openalex-snapshot
Fast Approximation Algorithms for Euclidean Minimum Weight Perfect Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_25openalex-snapshot
The Euclidean k-Supplier Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-38768-5_63openalex-snapshot
Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data
inferred← citeshttps://doi.org/10.1007/978-981-15-5580-0_6openalex-snapshot
Approach to UAV Swarm Control and Collision-Free Reconfiguration
inferred← citeshttps://doi.org/10.1007/bf01989743openalex-snapshot
A generalized hypergreedy algorithm for weighted perfect matching
inferred← citeshttps://doi.org/10.1007/bf02574695openalex-snapshot
A sparse graph almost as good as the complete graph on points inK dimensions
inferred← citeshttps://doi.org/10.1007/s10107-003-0438-yopenalex-snapshot
Approximation schemes for NP-hard geometric optimization problems: a survey
inferred← citeshttps://doi.org/10.1007/s11227-018-2673-2openalex-snapshot
A linear time randomized approximation algorithm for Euclidean matching
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90252-bopenalex-snapshot
Fast geometric approximation techniques and geometric embedding problems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.033openalex-snapshot
Maximum bipartite matchings with low rank data: Locality and perturbation analysis
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00015-8openalex-snapshot
Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646145openalex-snapshot
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743466openalex-snapshot
A divide-and-conquer algorithm for min-cost perfect matching in the plane
inferred← citeshttps://doi.org/10.1145/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
inferred← citeshttps://doi.org/10.1145/73833.73866openalex-snapshot
Fast geometric approximation techniques and geometric embedding problems
inferred← citeshttps://doi.org/10.1145/997817.997856openalex-snapshot
A near-linear constant-factor approximation for euclidean bipartite matching?
inferred← citeshttps://doi.org/10.1287/moor.2018.0953openalex-snapshot
The Euclidean k-Supplier Problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.