Pages that link to "Item:Q2254507"
From MaRDI portal
The following pages link to \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507):
Displaying 23 items.
- The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355) (← links)
- Improved approximations for cubic bipartite and cubic TSP (Q1801011) (← links)
- Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality (Q2353642) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- A 4/3-approximation for TSP on cubic 3-edge-connected graphs (Q2417175) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- Reassembling trees for the traveling salesman (Q2806177) (← links)
- \(\frac {13}{9}\)-approximation for graphic TSP (Q2904746) (← links)
- Removing and Adding Edges for the Traveling Salesman Problem (Q3177759) (← links)
- Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- Beating the Integrality Ratio for $s$-$t$-Tours in Graphs (Q6139824) (← links)
- An improved upper bound for the universal TSP on the grid (Q6621749) (← links)