The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2055574289
@@ Property / OpenAlex ID: W2055574289 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.7366
@@ Property / arXiv ID: 1412.7366 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4191856
@@ Property / cites work: Q4191856 / rank @@
+Normal rank
@@ Property / cites work @@
+On the nearest neighbor rule for the metric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+On the nearest neighbor rule for the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of two travelling salesman heuristics
+Normal rank
@@ Property / cites work @@
+The traveling salesman. Computational solutions for RSP applications
+Normal rank