A parameterized-complexity framework for finding local optima
From MaRDI portal
Cites work
- An application of simultaneous diophantine approximation in combinatorial optimization
- Clustering for edge-cost minimization (extended abstract)
- Complexity of local search for Euclidean clustering problems
- Finding 3-swap-optimal independent sets and dominating sets is hard
- Fundamentals of parameterized complexity
- Graph clustering problems under the Lens of parameterized local search
- How easy is local search?
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- Local search: is brute-force avoidable?
- Local search: simple, successful, but sometimes sluggish
- On the hardness of losing weight
- On the Power of Nodes of Degree Four in the Local Max-Cut Problem
- Parameterized algorithms
- Parameterized complexity and local search approaches for the stable marriage problem with ties
- Parameterized local search for vertex cover: when only the search radius is crucial
- Parametrized complexity theory.
- Polynomial kernels for weighted problems
- Simple Local Search Problems that are Hard to Solve
- Smoothed complexity of local max-cut and binary max-CSP
- The k-Opt algorithm for the traveling salesman problem has exponential running time for k 5
- The complexity of gradient descent: CLS = PPAD pls
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
- The complexity of the simplex method
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
- The parameterized complexity of local search for TSP, more refined
- Theoretical aspects of local search.
This page was built for publication: A parameterized-complexity framework for finding local optima
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445592)