Worst-case analysis of two travelling salesman heuristics (Q786657): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(84)90078-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2018689801
@@ Property / OpenAlex ID: W2018689801 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4744064
@@ Property / cites work: Q4744064 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for christofides' traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
+Normal rank
@@ Property / cites work @@
+Q4191856
@@ Property / cites work: Q4191856 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Several Heuristics for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank