Approximation properties of NP minimization classes
- 10 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 353-366
- https://doi.org/10.1109/sct.1991.160280
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Quantifiers and approximationPublished by Association for Computing Machinery (ACM) ,1990
- A structural overview of NP optimization problemsLecture Notes in Computer Science, 1989
- Optimization, approximation, and complexity classesPublished by Association for Computing Machinery (ACM) ,1988
- Optimization problems and the polynomial hierarchyTheoretical Computer Science, 1981
- Node-Deletion Problems on Bipartite GraphsSIAM Journal on Computing, 1981
- Edge-Deletion ProblemsSIAM Journal on Computing, 1981