On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality (Q2748380): 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.1002/net.1024
@@ Property / full work available at URL: https://doi.org/10.1002/net.1024 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1977056448
@@ Property / OpenAlex ID: W1977056448 / rank @@
+Normal rank
@@ Property / cites work @@
+Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
+Normal rank
@@ Property / cites work @@
+Minimum transversals of maximum matchings as approximate solutions to the bisection problem
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for multi-dimensional assignment problems with decomposable costs
+Normal rank
@@ Property / cites work @@
+Q3024765
@@ Property / cites work: Q3024765 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3677509
@@ Property / cites work: Q3677509 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2748380