Local search, reducibility and approximability of NP-optimization problems
From MaRDI portal
Recommendations
- Local search and the local structure of NP-complete problems
- scientific article; zbMATH DE number 861333
- Local search: complexity and approximation
- A note on the complexity of local search problems
- Computational bounds for local search in combinatorial optimization
- Approximate local search in combinatorial optimization
- Approximate Local Search in Combinatorial Optimization
- scientific article; zbMATH DE number 1944142
- A Survey of Approximation Results for Local Search Algorithms
- scientific article; zbMATH DE number 847149
Cites work
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 2077131 (Why is no real title available?)
- Approximate solution of NP optimization problems
- Completeness in approximation classes
- How easy is local search?
- Non deterministic polynomial optimization problems and their approximations
- Optimization, approximation, and complexity classes
- Structure preserving reductions among convex optimization problems
- Toward a unified approach for the classification of NP-complete optimization problems
Cited in
(12)- COMPLETENESS IN DIFFERENTIAL APPROXIMATION CLASSES
- Metaheuristics: A bibliography
- New local search approximation techniques for maximum generalized satisfiability problems
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\)
- Hitting times of local and global optima in genetic algorithms with very high selection pressure
- Analyzing the complexity of finding good neighborhood functions for local search algorithms
- Approximate solution of NP optimization problems
- Non-oblivious local search for graph and hypergraph coloring problems
- Local search for the minimum label spanning tree problem with bounded color classes.
- Evolutionary algorithms and dynamic programming
- Simple Local Search Problems that are Hard to Solve
- Finding optimal subgraphs by local search
This page was built for publication: Local search, reducibility and approximability of NP-optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673464)
