MNP: A class of NP optimization problems

DOI10.1007/BF02943150zbMath0881.68085MaRDI QIDQ1368182

Hong Zhu, Qi Cheng

Publication date: 28 September 1997

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

optimization problemsNP class

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The directed subgraph homeomorphism problem
• Optimization, approximation, and complexity classes
• Approximating maximum independent sets by excluding subgraphs
• Efficient probabilistically checkable proofs and applications to approximations

This page was built for publication: MNP: A class of NP optimization problems