Approximation properties of NP minimization classes
From MaRDI portal
Recommendations
Cited in
(20)- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP
- On fixed-parameter tractability and approximability of NP optimization problems
- The Shrinking Property for NP and coNP
- Local approximations for maximum partial subgraph problem.
- scientific article; zbMATH DE number 515741 (Why is no real title available?)
- The approximability of non-Boolean satisfiability problems and restricted integer programming
- scientific article; zbMATH DE number 2079029 (Why is no real title available?)
- A survey on the structure of approximation classes
- Safe approximation and its relation to kernelization
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- The shrinking property for NP and coNP
- Max NP-completeness made easy
- Logical definability of NP optimization problems
- Syntactic characterizations of polynomial time optimization classes
- Integer programming as a framework for optimization and approximability
- MNP: A class of NP optimization problems
- Structure of polynomial-time approximation
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
- Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap
- Hitting forbidden minors: approximation and kernelization
This page was built for publication: Approximation properties of NP minimization classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894448)
