Approximability of NP-optimization problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 847149
- scientific article; zbMATH DE number 4155842
- Approximability of hard combinatorial optimization problems: an introduction
- Inapproximability of combinatorial optimization problems
- Complexity and approximation. Combinatorial optimization problems and their approximability properties. Incl. 1 CD-ROM
Cited in
(16)- MNP: A class of NP optimization problems
- Approximability of hard combinatorial optimization problems: an introduction
- Reducing the number of solutions of NP functions
- NP-completeness of a combinator optimization problem
- Improving the complexities of approximation algorithms for optimization problems
- The complexity of approximating a nonlinear program
- Complexity of approximating bounded variants of optimization problems
- scientific article; zbMATH DE number 4155842 (Why is no real title available?)
- Weighted NP Optimization Problems: Logical Definability and Approximation Properties
- scientific article; zbMATH DE number 1263206 (Why is no real title available?)
- scientific article; zbMATH DE number 847149 (Why is no real title available?)
- Approximation algorithms for NP-hard problems
- Theory and Applications of Models of Computation
- Reoptimization of NP-Hard Problems
- Approximate solution of NP optimization problems
- Local search, reducibility and approximability of NP-optimization problems
This page was built for publication: Approximability of NP-optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4407450)
