Approximation Algorithms for the Traveling Salesman Problem with Range Condition (Q4522112): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2123771041
@@ Property / OpenAlex ID: W2123771041 / rank @@
+Normal rank
@@ Property / cites work @@
+Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
+Normal rank
@@ Property / cites work @@
+Q3024765
@@ Property / cites work: Q3024765 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501548
@@ Property / cites work: Q4501548 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5675543
@@ Property / cites work: Q5675543 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4155835
@@ Property / cites work: Q4155835 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster scaling algorithms for general graph matching problems
+Normal rank
@@ Property / cites work @@
+Q4496241
@@ Property / cites work: Q4496241 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941164
@@ Property / cites work: Q4941164 / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank