The parameterized complexity of local search for TSP, more refined (Q378245): Difference between revisions

@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+New classes of efficiently solvable generalized traveling salesman problems
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Kernelization: New Upper and Lower Bound Techniques
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of a new heuristic for the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
+Normal rank
@@ Property / cites work @@
+Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Local search: is brute-force avoidable?
@@ Property / cites work: Local search: is brute-force avoidable? / rank @@
+Normal rank
@@ Property / cites work @@
+Q3393448
@@ Property / cites work: Q3393448 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461908
@@ Property / cites work: Q4461908 / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental List Coloring of Graphs, Parameterized by Conservation
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q4365133
@@ Property / cites work: Q4365133 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461911
@@ Property / cites work: Q4461911 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of losing weight
@@ Property / cites work: On the hardness of losing weight / rank @@
+Normal rank
@@ Property / cites work @@
+Q5187226
@@ Property / cites work: Q5187226 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4904144
@@ Property / cites work: Q4904144 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization – Preprocessing with a Guarantee
@@ Property / cites work: Kernelization – Preprocessing with a Guarantee / rank @@
+Normal rank
@@ Property / cites work @@
+Searching the \(k\)-change neighborhood for TSP is W[1]-hard
+Normal rank
@@ Property / cites work @@
+Q3002818
@@ Property / cites work: Q3002818 / rank @@
+Normal rank
@@ Property / cites work @@
+Stable assignment with couples: parameterized complexity and local search
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Reflections on Multivariate Algorithmics and Problem Parameterization
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
+Normal rank