Pages that link to "Item:Q1894448"

The following pages link to Approximation properties of NP minimization classes (Q1894448):

Displaying 13 items.

• A survey on the structure of approximation classes (Q458503) (← links)
• Structure of polynomial-time approximation (Q692893) (← links)
• Integer programming as a framework for optimization and approximability (Q1276163) (← links)
• On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
• Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
• The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
• Max NP-completeness made easy (Q1960655) (← links)
• Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
• Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap (Q2868930) (← links)
• Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
• atalog: A logic language for expressing search and optimization problems (Q3550912) (← links)