New inapproximability bounds for TSP (Q494069): Difference between revisions

@@ Property / Wikidata QID @@
+Q55899759
@@ Property / Wikidata QID: Q55899759 / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Q5417632
@@ Property / cites work: Q5417632 / rank @@
+Normal rank
@@ Property / cites work @@
+/7-approximation algorithm for (1,2)-TSP
@@ Property / cites work: 8/7-approximation algorithm for (1,2)-TSP / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+Q4501548
@@ Property / cites work: Q4501548 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4103312
@@ Property / cites work: Q4103312 / rank @@
+Normal rank
@@ Property / cites work @@
+An explicit lower bound for TSP with distances one and two
+Normal rank
@@ Property / cites work @@
+TSP with bounded metrics
@@ Property / cites work: TSP with bounded metrics / rank @@
+Normal rank
@@ Property / cites work @@
+A Randomized Rounding Approach to the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation hardness of graphic TSP on cubic graphs
+Normal rank
@@ Property / cites work @@
+Q3191603
@@ Property / cites work: Q3191603 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Graphic TSP by Matchings
@@ Property / cites work: Approximating Graphic TSP by Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q2904746
@@ Property / cites work: Q2904746 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5494412
@@ Property / cites work: Q5494412 / rank @@
+Normal rank
@@ Property / cites work @@
+On the approximability of the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+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
+Normal rank