Pages that link to "Item:Q3194690"
From MaRDI portal
The following pages link to Approximation hardness of graphic TSP on cubic graphs (Q3194690):
Displaying 6 items.
- New inapproximability bounds for TSP (Q494069) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← 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)