Pages that link to "Item:Q2495698"
From MaRDI portal
The following pages link to On the approximability of the traveling salesman problem (Q2495698):
Displayed 19 items.
- On integrality ratios for asymmetric TSP in the Sherali-Adams hierarchy (Q312658) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- New inapproximability bounds for TSP (Q494069) (← links)
- Quell (Q500997) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- Approximation hardness of min-max tree covers (Q974986) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- A domination algorithm for {0,1}-instances of the travelling salesman problem (Q2811158) (← links)
- The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
- Approximating the Metric TSP in Linear Time (Q5302042) (← links)
- (Q5743429) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)