Pages that link to "Item:Q2488197"
From MaRDI portal
The following pages link to An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197):
Displaying 21 items.
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
- 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)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Improved approximations for cubic bipartite and cubic TSP (Q1801011) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- A new upper bound for the traveling salesman problem in cubic graphs (Q2250536) (← links)
- Multiobjective traveling salesperson problem on Halin graphs (Q2378458) (← 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)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← 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)
- Graphic TSP in cubic graphs (Q4636625) (← 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)
- On Dominating Even Subgraphs in Cubic Graphs (Q5346564) (← links)
