A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365): Difference between revisions

@@ Property / cites work @@
+Restricted delivery problems on a network
@@ Property / cites work: Restricted delivery problems on a network / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for christofides' traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
+Normal rank
@@ Property / cites work @@
+Q4247262
@@ Property / cites work: Q4247262 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Christofides' heuristic: some paths are more difficult than cycles
+Normal rank
@@ Property / cites work @@
+Procedures for travelling salesman problems with additional constraints
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(98)00046-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2162344698
@@ Property / OpenAlex ID: W2162344698 / rank @@
+Normal rank