On the public citation graph
New primal and dual matching heuristics
0 signed · 41 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230130105openalex-snapshot
Heuristics for planar minimum‐weight perfect metchings
inferredcites →https://doi.org/10.1002/net.3230130404openalex-snapshot
A survey of heuristics for the weighted matching problem
inferredcites →https://doi.org/10.1002/net.3230160102openalex-snapshot
Solving large‐scale matching problems efficiently: A new primal matching approach
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-3-642-69900-9openalex-snapshot
Data Structures and Algorithms 3
inferredcites →https://doi.org/10.1007/bf01415960openalex-snapshot
Optimal control of plotting and drilling machines: A case study
inferredcites →https://doi.org/10.1007/bf01584376openalex-snapshot
Solving matching problems with linear programming
inferredcites →https://doi.org/10.1007/bf01588956openalex-snapshot
Tight bounds for christofides' traveling salesman heuristic
inferredcites →https://doi.org/10.1007/bf01919172openalex-snapshot
Euclidean matching problems and the metropolis algorithm
inferredcites →https://doi.org/10.1007/bf02242021openalex-snapshot
Computing correct Delaunay triangulations
inferredcites →https://doi.org/10.1007/bfb0121194openalex-snapshot
A primal algorithm for optimum matching
inferredcites →https://doi.org/10.1007/s43069-021-00101-zopenalex-snapshot
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
inferredcites →https://doi.org/10.1016/0020-0190(86)90143-2openalex-snapshot
A lower bound to the complexity of Euclidean and rectilinear matching algorithms
inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50011-6openalex-snapshot
Practical use of Bucketing Techniques in Computational Geometry
inferredcites →https://doi.org/10.1017/s0305004100034095openalex-snapshot
The shortest path through many points
inferredcites →https://doi.org/10.1137/0210050openalex-snapshot
On a Greedy Heuristic for Complete Matching
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1145/48014.48015openalex-snapshot
A new class of heuristic algorithms for weighted perfect matching
inferredcites →https://doi.org/10.1145/800141.804689openalex-snapshot
Heuristics for weighted perfect matching
inferredcites →https://doi.org/10.15807/jorsj.27.306openalex-snapshot
IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
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.1002/net.20242openalex-snapshot
A linear programming approach to increasing the weight of all minimum spanning trees
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90045-5openalex-snapshot
Separating from the dominant of the spanning tree polytope
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00066-xopenalex-snapshot
An asymptotic theory for recurrence relations based on minimization and maximization
inferred← citeshttps://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
inferred← citeshttps://doi.org/10.1109/focs.2009.39openalex-snapshot
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
inferred← citeshttps://doi.org/10.1109/iccv.2017.184openalex-snapshot
Self-Paced Kernel Estimation for Robust Blind Image Deblurring
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.1137/090771429openalex-snapshot
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
inferred← citeshttps://doi.org/10.1137/s1052623400322287openalex-snapshot
The Steiner Traveling Salesman Polytope and Related Polyhedra
inferred← citeshttps://doi.org/10.1287/ijoc.11.2.138openalex-snapshot
Computing Minimum-Weight Perfect Matchings
inferred← citeshttps://doi.org/10.1287/moor.25.2.243.12223openalex-snapshot
Separation of Partition Inequalities
inferred← citeshttps://doi.org/10.5555/314464.314568openalex-snapshot
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
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.