On the public citation graph

Tight bounds for christofides' traveling salesman heuristic

https://doi.org/10.1007/bf01588956
0 signed · 50 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118627372.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/nav.3800300107openalex-snapshot
The traveling salesman problem: An update of research
inferred← citeshttps://doi.org/10.1002/net.3230110211openalex-snapshot
Complexity of vehicle routing and scheduling problems
inferred← citeshttps://doi.org/10.1002/net.3230120103openalex-snapshot
On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1002/net.3230160205openalex-snapshot
On the worst‐case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
inferred← citeshttps://doi.org/10.1002/net.3230220408openalex-snapshot
The swapping problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_3openalex-snapshot
Matching: Arc Routing and the Solution Connection
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_18openalex-snapshot
A Lower Bound for the Max Entropy Algorithm for TSP
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_15openalex-snapshot
A Hard Problem: The TSP
inferred← citeshttps://doi.org/10.1007/978-3-8351-9067-2_3openalex-snapshot
Approximation mit relativer Gütegarantie
inferred← citeshttps://doi.org/10.1007/978-94-009-7801-0_2openalex-snapshot
Worst-Case Analysis of Heuristic Algorithms for Scheduling and Packing
inferred← citeshttps://doi.org/10.1007/978-981-15-0105-0_2openalex-snapshot
Special Frequency Quadrilaterals and an Application
inferred← citeshttps://doi.org/10.1007/bf01084282openalex-snapshot
Discrete extremal problems
inferred← citeshttps://doi.org/10.1007/bf01293485openalex-snapshot
New primal and dual matching heuristics
inferred← citeshttps://doi.org/10.1007/bf01581633openalex-snapshot
A note on heuristics for the traveling salesman problem
inferred← citeshttps://doi.org/10.1007/bf01585735openalex-snapshot
Minimum-weight two-connected spanning networks
inferred← citeshttps://doi.org/10.1007/bf02591699openalex-snapshot
On the refinement of bounds of heuristics algorithms of the traveling salesman poblem
inferred← citeshttps://doi.org/10.1007/bfb0008936openalex-snapshot
Probabilistic analysis of some travelling salesman heuristics
inferred← citeshttps://doi.org/10.1007/bfb0028803openalex-snapshot
Discrete extremal problems on covering
inferred← citeshttps://doi.org/10.1007/s10107-025-02289-yopenalex-snapshot
A lower bound for the max entropy algorithm for TSP
inferred← citeshttps://doi.org/10.1007/s11750-007-0010-7openalex-snapshot
Comments on: Static pickup and delivery problems: a classification scheme and survey
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90161-nopenalex-snapshot
An approximation algorithm for the general routing problem
inferred← citeshttps://doi.org/10.1016/0166-218x(83)90102-6openalex-snapshot
An extension of Christofides heuristic to the k-person travelling salesman problem
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90008-6openalex-snapshot
Approximation algorithms for the geometric covering salesman problem
inferred← citeshttps://doi.org/10.1016/0167-6377(84)90078-6openalex-snapshot
Worst-case analysis of two travelling salesman heuristics
inferred← citeshttps://doi.org/10.1016/0167-6377(87)90012-5openalex-snapshot
Heuristics for unequal weight delivery problems with a fixed error guarantee
inferred← citeshttps://doi.org/10.1016/0167-6377(89)90037-0openalex-snapshot
Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90016-iopenalex-snapshot
Analysis of Christofides' heuristic: Some paths are more difficult than cycles
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90029-9openalex-snapshot
Topological design of ring networks
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90412-8openalex-snapshot
Heuristic methods and applications: A categorized survey
inferred← citeshttps://doi.org/10.1016/b978-0-12-734250-4.50010-2openalex-snapshot
COMBINATORIAL OPTIMIZATION: WHAT IS THE STATE OF THE ART?
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.03.021openalex-snapshot
Polynomial approximation algorithms with performance guarantees: An introduction-by-example
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.07.006openalex-snapshot
Stochastic single vehicle routing with a predefined customer sequence and multiple depot returns
inferred← citeshttps://doi.org/10.1016/j.endm.2009.02.004openalex-snapshot
Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
inferred← citeshttps://doi.org/10.1016/j.orl.2023.06.003openalex-snapshot
Truly tight bounds for TSP heuristics
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70821-5openalex-snapshot
Computational Complexity of Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1016/s0167-6377(98)00046-7openalex-snapshot
A -approximation algorithm for the clustered traveling salesman tour and path problems
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80121-5openalex-snapshot
Chapter 4 The traveling salesman problem
inferred← citeshttps://doi.org/10.1080/02331937908842609openalex-snapshot
Ein Beitrag zur Klassifizierung von Rundreiseproblemen
inferred← citeshttps://doi.org/10.1080/10637199708915622openalex-snapshot
SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
inferred← citeshttps://doi.org/10.1109/tnnls.2014.2354400openalex-snapshot
Opportunistic Behavior in Motivated Learning Agents
inferred← citeshttps://doi.org/10.1137/090746495openalex-snapshot
Degree Bounded Network Design with Metric Costs
inferred← citeshttps://doi.org/10.1145/800141.804689openalex-snapshot
Heuristics for weighted perfect matching
inferred← citeshttps://doi.org/10.1287/mnsc.26.1.1openalex-snapshot
Worst-Case Analysis of Heuristic Algorithms
inferred← citeshttps://doi.org/10.1287/moor.5.1.1openalex-snapshot
Combinatorial Optimization: What is the State of the Art
inferred← citeshttps://doi.org/10.1287/opre.45.4.639openalex-snapshot
An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
inferred← citeshttps://doi.org/10.1287/trsc.24.4.294openalex-snapshot
Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
inferred← citeshttps://doi.org/10.1524/9783486593778.bmopenalex-snapshot
Back Matter
inferred← citeshttps://doi.org/10.5121/ijaia.2014.5405openalex-snapshot
Comparison of Various Heuristic Search Techniques for Finding Shortest Path
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.