On the public citation graph
On the Approximation Hardness of Some Generalizations of TSP
0 signed · 33 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.1024openalex-snapshot
On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
inferredcites →https://doi.org/10.1007/3-540-36137-5openalex-snapshot
SOFSEM 2002: Theory and Practice of Informatics
inferredcites →https://doi.org/10.1007/3-540-47849-3_2openalex-snapshot
Stability of Approximation Algorithms for Hard Optimization Problems
inferredcites →https://doi.org/10.1007/3-540-63307-3_51openalex-snapshot
Constrained TSP and low-power computing
inferredcites →https://doi.org/10.1007/978-3-540-30577-4_18openalex-snapshot
On the Stability of Approximation for Hamiltonian Path Problems
inferredcites →https://doi.org/10.1007/b105088openalex-snapshot
SOFSEM 2005: Theory and Practice of Computer Science
inferredcites →https://doi.org/10.1007/s00224-007-1347-xopenalex-snapshot
The Parameterized Approximability of TSP with Deadlines
inferredcites →https://doi.org/10.1007/s00493-006-0008-zopenalex-snapshot
On The Approximability Of The Traveling Salesman Problem
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/s0020-0190(99)00160-xopenalex-snapshot
Performance guarantees for the TSP with a parameterized triangle inequality
inferredcites →https://doi.org/10.1016/s0304-3975(01)00287-0openalex-snapshot
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1051/ita:2000115openalex-snapshot
Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1137/s0895480192240226openalex-snapshot
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
inferredcites →https://doi.org/10.1145/1007352.1007385openalex-snapshot
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
inferredcites →https://doi.org/10.1145/335305.335320openalex-snapshot
On the approximability of the traveling salesman problem (extended abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_21openalex-snapshot
Reusing Optimal TSP Solutions for Locally Modified Input Instances
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_10openalex-snapshot
Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_5openalex-snapshot
On the Hardness of Reoptimization
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_12openalex-snapshot
Reoptimization of the Metric Deadline TSP
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_7openalex-snapshot
Improved Approximations for TSP with Simple Precedence Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-30217-6_42openalex-snapshot
Visualizing Clusters in Parallel Coordinates for Visual Knowledge Discovery
inferred← citeshttps://doi.org/10.1007/978-3-642-35843-2_15openalex-snapshot
Improved Approximations for Ordered TSP on Near-Metric Graphs,
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.126932openalex-snapshot
Complexity and resolution of spatio-temporal reasonings for criminology with greedy and evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/j.jda.2009.04.001openalex-snapshot
Reoptimization of the metric deadline TSP
inferred← citeshttps://doi.org/10.1016/j.jda.2013.04.002openalex-snapshot
Improved approximations for TSP with simple precedence constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.016openalex-snapshot
Approximation hardness of deadline-TSP reoptimization
inferred← citeshttps://doi.org/10.1051/ita/2014021openalex-snapshot
Improved approximations for ordered TSP on near-metric graphs
inferred← citeshttps://doi.org/10.1109/glocom.2014.7417469openalex-snapshot
A Public Vehicle System with Multiple Origin-Destination Pairs on Traffic Networks
inferred← citeshttps://doi.org/10.1109/glocom.2015.7417469openalex-snapshot
A Public Vehicle System with Multiple Origin-Destination Pairs on Traffic Networks
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.