{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:23:54Z","timestamp":1725495834719},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669166"},{"type":"electronic","value":"9783540466321"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46632-0_6","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:45:01Z","timestamp":1195933501000},"page":"49-55","source":"Crossref","is-referenced-by-count":0,"title":["Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability"],"prefix":"10.1007","author":[{"given":"Daya Ram","family":"Gaur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Krishnamurti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"6_CR1","unstructured":"M. Garey and D. Johnson. Computers and intractability: a guide to the theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson, and L. J. Stockmeyer. Some simplified np-complete graph problems. Theoretical Computer Science, 1:237\u2013267, 1976.","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"M. Goemans and D. P. Williamson. 0.878 approximation algorithms for MAX-CUT and max-2sat. In Proceedings of the 26th. annual ACM symposium on theory of computing, pages 422\u2013431, 1994.","DOI":"10.1145\/195058.195216"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"M. Goemans","year":"1994","unstructured":"M. Goemans and D. P. Williamson. New 3\/4 approximation algorithms for MAX-CUT. SIAM J. Disc. Math., 7:656\u2013666, 1994.","journal-title":"SIAM J. Disc. Math"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. Johnson","year":"1974","unstructured":"D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and Systems Science, 9:256\u2013278, 1974.","journal-title":"Journal of Computer and Systems Science"},{"key":"6_CR6","unstructured":"C. Papadimitriou. Computational Complexity. Addison Wesley, 1994."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46632-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T02:04:30Z","timestamp":1557021870000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46632-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669166","9783540466321"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-46632-0_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}