An improved approximation algorithm for the clustered traveling salesman problem (Q456175): 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/j.ipl.2012.08.020
+Normal rank
@@ Property / OpenAlex ID @@
+W1978707544
@@ Property / OpenAlex ID: W1978707544 / rank @@
+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 / cites work @@
+Combinatorial optimization. Theory and applications.
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:456175