Q5111717 (Q5111717): Difference between revisions

@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+On exact algorithms for treewidth
@@ Property / cites work: On exact algorithms for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of a new heuristic for the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+A Method for Solving Traveling-Salesman Problems
@@ Property / cites work: A Method for Solving Traveling-Salesman Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Improving TSP Tours Using Dynamic Programming over Tree Decompositions.
+Normal rank
@@ Property / cites work @@
+Fine-grained complexity analysis of two classic TSP variants
+Normal rank
@@ Property / cites work @@
+On two techniques of combining branching and treewidth
+Normal rank
@@ Property / cites work @@
+Pathwidth of cubic graphs and exact algorithms
@@ Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Induced Subgraphs via Minimal Triangulations
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of local search for TSP, more refined
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+An effective implementation of the Lin-Kernighan traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic programming meets the principle of inclusion and exclusion
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding and Verifying Locally Optimal Solutions
+Normal rank
@@ Property / cites work @@
+Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
+Normal rank
@@ Property / cites work @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Computer Solutions of the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise
+Normal rank
@@ Property / cites work @@
+Searching the \(k\)-change neighborhood for TSP is W[1]-hard
+Normal rank
@@ Property / cites work @@
+A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
+Normal rank
@@ Property / cites work @@
+Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs
+Normal rank
@@ Property / cites work @@
+Subcubic Equivalences Between Path, Matrix, and Triangle Problems
+Normal rank