A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem (Q1130068): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4744064
@@ Property / cites work: Q4744064 / rank @@
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Search for the Asymmetric Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q5519710
@@ Property / cites work: Q5519710 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ Property / cites work @@
+A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the asymmetric travelling salesman problem with distances one and two
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0377-2217(94)00010-a
+Normal rank
@@ Property / OpenAlex ID @@
+W2039862207
@@ Property / OpenAlex ID: W2039862207 / rank @@
+Normal rank