{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:45:44Z","timestamp":1772552744720,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1023\/a:1011453115618","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T10:16:33Z","timestamp":1040638593000},"page":"167-173","source":"Crossref","is-referenced-by-count":2,"title":["Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability"],"prefix":"10.1007","volume":"5","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","reference":[{"key":"333480_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979."},{"key":"333480_CR2","doi-asserted-by":"crossref","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, \u201cSome Simplified NP-Complete Graph Problems,\u201d Theoretical Computer Science, vol. 1, pp. 237-267, 1976.","journal-title":"Theoretical Computer Science"},{"key":"333480_CR3","doi-asserted-by":"crossref","unstructured":"M. Goemans and D.P. Williamson, \u201c0.878 approximation algorithms for MAX-CUT and max-2sat,\u201d in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994a, pp. 422-431.","DOI":"10.1145\/195058.195216"},{"key":"333480_CR4","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"M. Goemans","year":"1994","unstructured":"M. Goemans and D.P. Williamson, \u201cNew 3\/4 approximation algorithms for MAX-CUT,\u201d SIAM J. Disc. Math., vol. 7, pp. 656-666, 1994b.","journal-title":"SIAM J. Disc. Math."},{"key":"333480_CR5","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. Johnson","year":"1974","unstructured":"D. Johnson, \u201cApproximation algorithms for combinatorial problems,\u201d Journal of Computer and Systems Science, vol. 9, pp. 256-278, 1974.","journal-title":"Journal of Computer and Systems Science"},{"key":"333480_CR6","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"C. Papadimitriou, Computational Complexity, Addison Wesley, Reading, MA, 1994."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011453115618.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011453115618\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011453115618.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:09:48Z","timestamp":1751281788000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011453115618"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["333480"],"URL":"https:\/\/doi.org\/10.1023\/a:1011453115618","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}