On the public citation graph

A Permanent Approach to the Traveling Salesman Problem

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.
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/rsa.1024openalex-snapshot
Hamilton cycles containing randomly selected edges in random regular graphs
inferredcites →https://doi.org/10.1006/jctb.1997.1798openalex-snapshot
Counting 1-Factors in Regular Bipartite Graphs
inferredcites →https://doi.org/10.1007/978-3-642-20807-2_6openalex-snapshot
TSP on Cubic and Subcubic Graphs
inferredcites →https://doi.org/10.1007/bf00968054openalex-snapshot
Proof of the van der Waerden conjecture for permanents
inferredcites →https://doi.org/10.1007/bf01163285openalex-snapshot
Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
inferredcites →https://doi.org/10.1007/s00224-012-9439-7openalex-snapshot
$\frac{13}{9}$ -Approximation for Graphic TSP
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/0012-365x(83)90021-3openalex-snapshot
Limit distribution for the existence of hamiltonian cycles in a random graph
inferredcites →https://doi.org/10.1016/j.orl.2004.09.005openalex-snapshot
An improved upper bound for the TSP in cubic 3-edge-connected graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73007-xopenalex-snapshot
First Occurrence of Hamilton Cycles in Random Graphs
inferredcites →https://doi.org/10.1109/focs.2011.56openalex-snapshot
Approximating Graphic TSP by Matchings
inferredcites →https://doi.org/10.1109/focs.2011.80openalex-snapshot
A Randomized Rounding Approach to the Traveling Salesman Problem
inferredcites →https://doi.org/10.1109/sfcs.1995.492665openalex-snapshot
An approximation scheme for planar graph TSP
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs
inferredcites →https://doi.org/10.1137/0218077openalex-snapshot
Approximating the Permanent
inferredcites →https://doi.org/10.1137/060649562openalex-snapshot
A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
inferredcites →https://doi.org/10.1137/s0097539796309764openalex-snapshot
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k -MST, and Related Problems
inferredcites →https://doi.org/10.1145/1008731.1008738openalex-snapshot
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
inferredcites →https://doi.org/10.1145/103418.103442openalex-snapshot
Finding hidden Hamiltonian cycles
inferredcites →https://doi.org/10.1145/1993636.1993696openalex-snapshot
Contraction decomposition in h-minor-free graphs and algorithmic applications
inferredcites →https://doi.org/10.1145/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
inferredcites →https://doi.org/10.1145/800105.803393openalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.48550/arxiv.1101.5586openalex-snapshot
A 4/3-approximation for TSP on cubic 3-edge-connected graphs

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-3-319-07557-0_23openalex-snapshot
Short Tours through Large Linear Forests
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_26openalex-snapshot
Graph-TSP from Steiner Cycles
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_45openalex-snapshot
A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_61openalex-snapshot
An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_18openalex-snapshot
Semantic Equivalence of Graph Polynomials Definable in Second Order Logic
inferred← citeshttps://doi.org/10.1016/j.apal.2019.04.007openalex-snapshot
A logician's view of graph polynomials
inferred← citeshttps://doi.org/10.1016/j.autcon.2018.09.001openalex-snapshot
Self-correcting neural network in road pavement diagnostics
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.038openalex-snapshot
A 97 -approximation algorithm for Graphic TSP in cubic bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.08.021openalex-snapshot
On testing Hamiltonicity of graphs
inferred← citeshttps://doi.org/10.1016/j.ic.2014.09.007openalex-snapshot
Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications
inferred← citeshttps://doi.org/10.1080/00207543.2019.1637036openalex-snapshot
Non-approximability of the single crane container transhipment problem
inferred← citeshttps://doi.org/10.1145/2591796.2591803openalex-snapshot
Entropy, optimization and counting
inferred← citeshttps://doi.org/10.21015/vtse.v7i1.339openalex-snapshot
The Use Of Tsp For The Application Of Pos Indonesia Delivery Service
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2015.125openalex-snapshot
Approximating the Regular Graphic TSP in Near Linear Time
inferred← citeshttps://doi.org/10.48550/arxiv.1304.8108openalex-snapshot
Entropy, Optimization and Counting
inferred← citeshttps://doi.org/10.48550/arxiv.1305.2533openalex-snapshot
Partition functions for dense instances of combinatorial enumeration problems
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.