Approximating the Minimum Tour Cover with a Compact Linear Program (Q3192959): Difference between revisions

@@ Property / cites work @@
+Approximating the tree and tour covers of a graph
@@ Property / cites work: Approximating the tree and tour covers of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of a new heuristic for the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Q4414633
@@ Property / cites work: Q4414633 / rank @@
+Normal rank
@@ Property / cites work @@
+How to trim a MST
@@ Property / cites work: How to trim a MST / rank @@
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the minimum weight edge dominating set problem
+Normal rank
@@ Property / cites work @@
+Improved approximations for tour and tree covers
@@ Property / cites work: Improved approximations for tour and tree covers / rank @@
+Normal rank