Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412): Difference between revisions

@@ Property / cites work @@
+Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999
+Normal rank
@@ Property / cites work @@
+Q3044310
@@ Property / cites work: Q3044310 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4864690
@@ Property / cites work: Q4864690 / rank @@
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Christofides' heuristic: some paths are more difficult than cycles
+Normal rank
@@ Property / cites work @@
+Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
+Normal rank
@@ Property / cites work @@
+An extension of Christofides heuristic to the k-person travelling salesman problem
+Normal rank
@@ Property / cites work @@
+\(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
+Normal rank
@@ Property / cites work @@
+A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4217266
@@ Property / cites work: Q4217266 / rank @@
+Normal rank
@@ Property / cites work @@
+On two geometric problems related to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Q2718910
@@ Property / cites work: Q2718910 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroids and a forest cover problem
@@ Property / cites work: Matroids and a forest cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank