Toward a unified approach for the classification of NP-complete optimization problems
From MaRDI portal
Cites work
- `` Strong NP-Completeness Results
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Heuristic evaluation techniques for bin packing approximation algorithms
- scientific article; zbMATH DE number 3733262 (Why is no real title available?)
- scientific article; zbMATH DE number 3495588 (Why is no real title available?)
- scientific article; zbMATH DE number 3551892 (Why is no real title available?)
- scientific article; zbMATH DE number 3557234 (Why is no real title available?)
- scientific article; zbMATH DE number 3569828 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3593565 (Why is no real title available?)
- Limiting recursion
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
Cited in
(17)- On different approximation criteria for subset product problems
- On the complexity of approximating the independent set problem
- Optimization, approximation, and complexity classes
- Quantifiers and approximation
- New local search approximation techniques for maximum generalized satisfiability problems
- On the differential approximation of MIN SET COVER
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- An Improved Approximation Bound for Spanning Star Forest and Color Saving
- On the complexity of approximating the independent set problem (extended abstract)
- Approximate solution of NP optimization problems
- Local search, reducibility and approximability of NP-optimization problems
- Improving known solutions is hard
- Detection and localization of hidden radioactive sources with spatial statistical method
- Completeness in approximation classes
- Polynomial time approximation schemes and parameterized complexity
- A better differential approximation ratio for symmetric TSP
This page was built for publication: Toward a unified approach for the classification of NP-complete optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1143789)
