Approximating the metric TSP in linear time (Q649110): Difference between revisions

@@ Property / describes a project that uses @@
+TSPLIB
@@ Property / describes a project that uses: TSPLIB / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Concorde
@@ Property / describes a project that uses: Concorde / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Blossom V
@@ Property / describes a project that uses: Blossom V / rank @@
+Normal rank
@@ 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.1007/s00224-010-9289-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2054572608
@@ Property / OpenAlex ID: W2054572608 / rank @@
+Normal rank
@@ Property / cites work @@
+On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+Q4501548
@@ Property / cites work: Q4501548 / rank @@
+Normal rank
@@ Property / cites work @@
+The Travelling Salesman and the PQ-Tree
@@ Property / cites work: The Travelling Salesman and the PQ-Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP
+Normal rank
@@ Property / cites work @@
+Fast minimum-weight double-tree shortcutting for metric TSP
+Normal rank
@@ Property / cites work @@
+Min-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
+Normal rank
@@ Property / cites work @@
+A linear-time approximation algorithm for weighted matchings in graphs
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+Normal rank
@@ Property / cites work @@
+Sublinear time algorithms for metric space problems
+Normal rank
@@ Property / cites work @@
+Blossom V: A new implementation of a minimum cost perfect matching algorithm
+Normal rank
@@ Property / cites work @@
+On the approximability of the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the watchman route and zookeeper's problems.
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:649110