\(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326): Difference between revisions

@@ Property / cites work @@
+A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
+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 @@
+On the complexity of graph tree partition problems.
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+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 @@
+Q2718910
@@ Property / cites work: Q2718910 / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
+Normal rank
@@ Property / cites work @@
+The traveling salesman. Computational solutions for RSP applications
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank