Maximum bounded H-matching is MAX SNP-complete
- 22 March 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 49 (6), 309-318
- https://doi.org/10.1016/0020-0190(94)90105-8
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Maximum bounded 3-dimensional matching is MAX SNP-completeInformation Processing Letters, 1991
- Generalized planar matchingJournal of Algorithms, 1990