Maximum bounded 3-dimensional matching is MAX SNP-complete
- 10 January 1991
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 37 (1), 27-35
- https://doi.org/10.1016/0020-0190(91)90246-e
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- Optimization, approximation, and complexity classesPublished by Association for Computing Machinery (ACM) ,1988
- An efficient approximation scheme for the one-dimensional bin-packing problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982