{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T14:25:16Z","timestamp":1775139916493,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,3]]},"DOI":"10.1016\/0020-0190(94)90105-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"309-318","source":"Crossref","is-referenced-by-count":34,"title":["Maximum bounded H-matching is MAX SNP-complete"],"prefix":"10.1016","volume":"49","author":[{"given":"Viggo","family":"Kann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90105-8_BIB1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/SFCS.1992.267823","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992","journal-title":"Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)90105-8_BIB2","first-page":"265","article-title":"Approximation algorithms for NP-complete problems on planar graphs","author":"Baker","year":"1983","journal-title":"Proc. 24th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(94)90105-8_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0196-6774(90)90001-U","article-title":"Generalized planar matching","volume":"11","author":"Berman","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(94)90105-8_BIB4","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","article-title":"Maximum bounded 3-dimensional matching is MAX SNP-complete","volume":"37","author":"Kann","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)90105-8_BIB5","article-title":"On the approximability of NP-complete optimization problems","author":"Kann","year":"1992"},{"key":"10.1016\/0020-0190(94)90105-8_BIB6","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094901058?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094901058?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:50:04Z","timestamp":1555145404000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094901058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0020019094901058"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90105-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}