Q2861509 (Q2861509): Difference between revisions

@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q3138916
@@ Property / cites work: Q3138916 / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
+Normal rank
@@ Property / cites work @@
+On some connectivity properties of Eulerian graphs
+Normal rank
@@ Property / cites work @@
+A 2log2(n)-Approximation Algorithm for Directed Tour Cover
+Normal rank
@@ Property / cites work @@
+Analyzing the Held-Karp TSP bound: A monotonicity property with application
+Normal rank