A note on approximation algorithms of the clustered traveling salesman problem (Q2398506): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2017.07.003
@@ Property / DOI: 10.1016/j.ipl.2017.07.003 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2017.07.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2734875663
@@ Property / OpenAlex ID: W2734875663 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the clustered traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Some Postman Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Analysis of Christofides' heuristic: some paths are more difficult than cycles
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2017.07.003
@@ Property / DOI: 10.1016/J.IPL.2017.07.003 / rank @@
+Normal rank