The following pages link to (Q2904746):
Displaying 11 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)
- New inapproximability bounds for TSP (Q494069) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem (Q2450741) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- (Q3191144) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
