Pages that link to "Item:Q2495698"

The following pages link to On the approximability of the traveling salesman problem (Q2495698):

Displaying 50 items.

• On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
• 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)
• A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← 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)
• Efficiency of a local algorithm for solving the traveling salesman problem (Q916576) (← links)
• Approximation hardness of min-max tree covers (Q974986) (← links)
• Truncated \(M\)-travelling salesman problem (Q998696) (← links)
• A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480) (← links)
• Operational estimators for the length of a traveling salesman tour (Q1206381) (← links)
• Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← 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)
• The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838) (← 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)
• (Q2991763) (← links)
• Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
• Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
• (Q3079180) (← links)
• Improved inapproximability for TSP (Q3191603) (← links)
• (Q3440942) (← links)
• A Constant Approximation Algorithm for the a priori Traveling Salesman Problem (Q3503857) (← links)
• A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem (Q3638885) (← links)
• (Q4252306) (← links)
• (Q4297219) (← links)
• On the Significance of the Initial Solution in Travelling Salesman Heuristics (Q4319780) (← links)
• (Q4350076) (← links)
• (Q4472495) (← links)
• (Q4494938) (← links)
• (Q4501237) (← links)
• (Q4517278) (← links)
• Improved Lower Bounds on the Approximability of the Traveling Salesman Problem (Q4522114) (← links)
• On the Metric $s$--$t$ Path Traveling Salesman Problem (Q4641715) (← links)
• Provably good solutions for the traveling salesman problem (Q4698114) (← links)
• (Q4782716) (← links)
• (Q4852853) (← links)
• TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
• Approximating the Metric TSP in Linear Time (Q5302042) (← links)
• The analyst's traveling salesman theorem in graph inverse limits (Q5350296) (← links)
• (Q5743429) (← links)
• Travelling on graphs with small highway dimension (Q5925522) (← links)
• A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
• Ailsa H. Land and her 1979 study of the traveling salesman problem: personal reminiscences and historical remarks (Q6169990) (← links)
• Some contributions of Ailsa H. Land to the study of the traveling salesman problem (Q6169992) (← links)