Pages that link to "Item:Q3194690"
From MaRDI portal
The following pages link to Approximation hardness of graphic TSP on cubic graphs (Q3194690):
Displaying 14 items.
- New inapproximability bounds for TSP (Q494069) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q2741456) (← 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)
- A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs (Q2969624) (← links)
- Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← 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)
- New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
- Beating the Integrality Ratio for $s$-$t$-Tours in Graphs (Q6139824) (← links)