On the public citation graph

On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality

0 signed · 67 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/9781119584445.ch10openalex-snapshot
The Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/3-540-48447-7_10openalex-snapshot
Performance Guarantees for the TSP with a Parameterized Triangle Inequality
inferredcites →https://doi.org/10.1007/978-3-642-61649-5_4openalex-snapshot
Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf02953326openalex-snapshot
Minimum transversals of maximum matchings as approximate solutions to the bisection problem
inferredcites →https://doi.org/10.1016/0166-218x(94)90199-6openalex-snapshot
Approximation algorithms for multi-dimensional assignment problems with decomposable costs
inferredcites →https://doi.org/10.1023/a:1008023416823openalex-snapshot
Relaxing the Triangle Inequality in Pattern Matching
inferredcites →https://doi.org/10.1137/s0895480192240226openalex-snapshot
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
inferredcites →https://doi.org/10.4171/owr/2008/51openalex-snapshot
Combinatorial Optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11534273_18openalex-snapshot
The Minimum-Area Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/11785293_19openalex-snapshot
On the Approximation Hardness of Some Generalizations of TSP
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_7openalex-snapshot
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality
inferred← citeshttps://doi.org/10.1007/3-540-44849-7_24openalex-snapshot
On k-Edge-Connectivity Problems with Sharpened Triangle Inequality
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_14openalex-snapshot
An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
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-030-01120-8_26openalex-snapshot
Sensitivity Analysis for Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_14openalex-snapshot
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_10openalex-snapshot
The Approximability of the p-hub Center Problem with Parameterized Triangle Inequality
inferred← citeshttps://doi.org/10.1007/978-3-319-94667-2_10openalex-snapshot
Approximation Algorithms for the p-Hub Center Routing Problem in Parameterized Metric Graphs
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-319-98355-4_22openalex-snapshot
A Modern View on Stability of Approximation
inferred← citeshttps://doi.org/10.1007/978-3-540-30577-4_18openalex-snapshot
On the Stability of Approximation for Hamiltonian Path Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69170-9_19openalex-snapshot
Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_5openalex-snapshot
Approximating the Metric TSP in Linear Time
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-13182-0_17openalex-snapshot
Algorithmics – Is There Hope for a Unified Theory?
inferred← citeshttps://doi.org/10.1007/978-3-642-19391-0_1openalex-snapshot
Improved Approximations for Hard Optimization Problems via Problem Instance Classification
inferred← citeshttps://doi.org/10.1007/978-3-642-27660-6_29openalex-snapshot
On the Approximation Ratio of the Path Matching Christofides Algorithm
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.1007/978-981-95-0218-9_21openalex-snapshot
An FPT Factor-11 Approximation Algorithm for TSP
inferred← citeshttps://doi.org/10.1007/s00224-007-1347-xopenalex-snapshot
The Parameterized Approximability of TSP with Deadlines
inferred← citeshttps://doi.org/10.1007/s00224-010-9289-0openalex-snapshot
Approximating the Metric TSP in Linear Time
inferred← citeshttps://doi.org/10.1007/s00236-025-00518-7openalex-snapshot
On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00941-zopenalex-snapshot
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality
inferred← citeshttps://doi.org/10.1007/s00453-024-01257-wopenalex-snapshot
On a Traveling Salesman Problem for Points in the Unit Cube
inferred← citeshttps://doi.org/10.1007/s11590-025-02242-0openalex-snapshot
Some worst-case results related to the asymmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s12543-011-0062-0openalex-snapshot
Methods for Solving Fuzzy Assignment Problems and Fuzzy Travelling Salesman Problems with Different Membership Functions
inferred← citeshttps://doi.org/10.1016/j.adhoc.2010.08.016openalex-snapshot
Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
inferred← citeshttps://doi.org/10.1016/j.comgeo.2006.03.001openalex-snapshot
The minimum-area spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.06.003openalex-snapshot
Symmetric connectivity with directional antennas
inferred← citeshttps://doi.org/10.1016/j.dam.2019.08.007openalex-snapshot
A 4-approximation algorithm for the TSP-Path satisfying a biased triangle inequality
inferred← citeshttps://doi.org/10.1016/j.disc.2012.12.009openalex-snapshot
Laplacian eigenvalues of the second power of a graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.06.003openalex-snapshot
An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.06.009openalex-snapshot
Approximate spanning cactus
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.09.012openalex-snapshot
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
inferred← citeshttps://doi.org/10.1016/j.jda.2005.07.004openalex-snapshot
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
inferred← citeshttps://doi.org/10.1016/j.jda.2008.03.003openalex-snapshot
On k-connectivity problems with sharpened triangle inequality
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.2004.06.019openalex-snapshot
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.10.026openalex-snapshot
On the relationship between ATSP and the cycle cover problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.09.017openalex-snapshot
Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.004openalex-snapshot
Relaxed triangle inequality ratio of the Sørensen–Dice and Tversky indexes
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.05.008openalex-snapshot
Approximation algorithms for the p-hub center routing problem in parameterized metric graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00160-xopenalex-snapshot
Performance guarantees for the TSP with a parameterized triangle inequality
inferred← citeshttps://doi.org/10.1051/ita/2013040openalex-snapshot
Analysis of a near-metric TSP approximation algorithm
inferred← citeshttps://doi.org/10.1051/ita/2014021openalex-snapshot
Improved approximations for ordered TSP on near-metric graphs
inferred← citeshttps://doi.org/10.1109/ics51289.2020.00034openalex-snapshot
The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs
inferred← citeshttps://doi.org/10.1186/s13663-022-00736-5openalex-snapshot
Solving nonlinear and dynamic programming equations on extended b-metric spaces with the fixed-point technique
inferred← citeshttps://doi.org/10.2139/ssrn.5083035openalex-snapshot
The GOOGLE and XPRIZE award for how to use quantum computers practically: The problem of the "P" versus "NP" outputs of any quantum computer and the pathway for its resolving
inferred← citeshttps://doi.org/10.2989/16073606.2024.2352568openalex-snapshot
On the general position number of the k -th power graphs
inferred← citeshttps://doi.org/10.35376/10324/6901openalex-snapshot
Procedimientos estadísticos para modelos circulares con restricciones de orden aplicados al análisis de expresiones de genes
inferred← citeshttps://doi.org/10.3929/ethz-a-006519144openalex-snapshot
Analysis of approximation algorithms for the traveling salesman problem in near-metric graphs
inferred← citeshttps://doi.org/10.3929/ethz-a-007089803openalex-snapshot
Measuring hardness of complex problems: Approximability and exact algorithms
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2458openalex-snapshot
The Traveling Salesman Problem under Squared Euclidean Distances
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0236openalex-snapshot
The Traveling Salesman Problem Under Squared Euclidean Distances
inferred← citeshttps://doi.org/10.48550/arxiv.1108.0492openalex-snapshot
Symmetric Connectivity with Directional Antennas
inferred← citeshttps://doi.org/10.6703/ijase.2012.10(3).155openalex-snapshot
Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters
inferred← citeshttps://doi.org/10.70675/5bd7ecfazbf47z43ccz8f1ez491f21159168openalex-snapshot
On some subgraph optimization problems for 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.