Cited in
(36)- Simple cubic graphs with no short traveling salesman tour
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two
- Constant factor approximation for ATSP with two edge weights
- Approximating TSP walks in subcubic graphs
- Weighted amplifiers and inapproximability results for travelling salesman problem
- \(\frac{13}{9}\)-approximation for graphic TSP
- On the minimum leaf number of cubic graphs
- Approximating minimum-cost connected \(T\)-joins
- An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality
- A 4/3-approximation for TSP on cubic 3-edge-connected graphs
- An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem
- The traveling salesman problem on cubic and subcubic graphs
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph
- Reassembling trees for the traveling salesman
- Towards better inapproximability bounds for TSP: a challenge of global dependencies
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs
- Constant factor approximation for ATSP with two edge weights (extended abstract)
- Improved Approximations for Cubic Bipartite and Cubic TSP
- The Steiner traveling salesman problem with online edge blockages
- scientific article; zbMATH DE number 6347354 (Why is no real title available?)
- Approximation hardness of graphic TSP on cubic graphs
- Special frequency quadrilaterals and an application
- Cubic TSP: A 1.3-Approximation
- Spanning closed walks and TSP in 3-connected planar graphs
- Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
- New inapproximability bounds for TSP
- TSP tours in cubic graphs: beyond 4/3
- A proof of the Boyd-Carr conjecture
- A deterministic better-than-3/2 approximation algorithm for metric TSP
- An improved upper bound for the universal TSP on the grid
- Sublinear algorithms and lower bounds for metric TSP cost estimation
- Sublinear algorithms for TSP via path covers
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- On polynomial kernels for traveling salesperson problem and its generalizations
- Approximating graphic min-max and minimum cycle/path/tree cover problems
This page was built for publication: Approximating Graphic TSP by Matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494987)
