A 4/3-approximation algorithm for half-integral cycle cut instances of the TSP (Q6086003): Difference between revisions

@@ Property / cites work @@
+Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
+Normal rank
@@ Property / cites work @@
+The salesman's improved tours for fundamental classes
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Matroid-based TSP rounding for half-integral solutions
+Normal rank
@@ Property / cites work @@
+The Traveling-Salesman Problem and Minimum Spanning Trees
+Normal rank
@@ Property / cites work @@
+A (slightly) improved approximation algorithm for metric TSP
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for TSP in the half integral case
+Normal rank
@@ Property / cites work @@
+Removing and Adding Edges for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture
+Normal rank
@@ Property / cites work @@
+Q3931037
@@ Property / cites work: Q3931037 / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristic analysis, linear programming and branch and bound
+Normal rank