The following pages link to TSP on Cubic and Subcubic Graphs (Q3009751):
Displaying 17 items.
- 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 (Q484552) (← links)
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
- A 4/3-approximation for TSP on cubic 3-edge-connected graphs (Q2417175) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- The Parity Hamiltonian Cycle Problem in Directed Graphs (Q2835661) (← links)
- Finding 2-factors closer to TSP tours in cubic graphs (Q2848544) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
- Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- An Improved Exact Algorithm for Cubic Graph TSP (Q3608837) (← links)
- Cubic TSP: A 1.3-Approximation (Q4581212) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
- (Q5743492) (← links)
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
