Local search: is brute-force avoidable? (Q439931): Difference between revisions

@@ Property / author @@
-Frances A. Rosamond
@@ Property / author: Frances A. Rosamond / rank @@
-Normal rank
@@ Property / author @@
+Frances A. Rosamond
@@ Property / author: Frances A. Rosamond / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+T20
@@ Property / Mathematics Subject Classification ID: 68T20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6067700
@@ Property / zbMATH DE Number: 6067700 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+local search
@@ Property / zbMATH Keywords: local search / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+local treewidth
@@ Property / zbMATH Keywords: local treewidth / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57359626
@@ Property / Wikidata QID: Q57359626 / rank @@
+Normal rank
@@ 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.1016/j.jcss.2011.10.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2165930352
@@ Property / OpenAlex ID: W2165930352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4365129
@@ Property / cites work: Q4365129 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4365126
@@ Property / cites work: Q4365126 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+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 @@
+Fixed-parameter algorithms for (             <i>k</i>             ,             <i>r</i>             )-center in planar graphs and map graphs
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Linearity of grid minors in treewidth with applications through bidimensionality
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Note on the Convergence of Simulated Annealing Algorithms
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+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 @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Local tree-width, excluded minors, and approximation algorithms
+Normal rank
@@ Property / cites work @@
+A constant factor approximation algorithm for a class of classification problems
+Normal rank
@@ Property / cites work @@
+Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+On Syntactic versus Computational Views of Approximability
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+On Local Search and Placement of Meters in Networks
+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 @@
+An Effective Heuristic Algorithm for the Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Searching the \(k\)-change neighborhood for TSP is W[1]-hard
+Normal rank
@@ Property / cites work @@
+Theoretical aspects of local search.
@@ Property / cites work: Theoretical aspects of local search. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Local Search for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+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 @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:439931