A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time (Q1183480): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(91)90118-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2009175527
@@ Property / OpenAlex ID: W2009175527 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric applications of a matrix-searching algorithm
+Normal rank
@@ Property / cites work @@
+Sequence comparison with mixed convex and concave costs
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for concave one-dimensional dynamic programming
+Normal rank
@@ Property / cites work @@
+Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q3768703
@@ Property / cites work: Q3768703 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5557602
@@ Property / cites work: Q5557602 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line dynamic programming with applications to the prediction of RNA secondary structure
+Normal rank
@@ Property / cites work @@
+The concave least-weight subsequence problem revisited
+Normal rank