{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:08:14Z","timestamp":1725455294403},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605737"},{"type":"electronic","value":"9783540477662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015420","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:50:06Z","timestamp":1131864606000},"page":"163-170","source":"Crossref","is-referenced-by-count":0,"title":["An approximation algorithm for MAX 3-SAT"],"prefix":"10.1007","author":[{"given":"Takao","family":"Ono","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomio","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Asano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proc. 25th STOC, pages 294\u2013304, 1993.","DOI":"10.1145\/167088.167174"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Michel X. Goemans and David P. Williamson. 878-approximation algorithms for MAX CUT and MAX 2SAT. In Proc. 26th STOC, pages 422\u2013431, 1994.","DOI":"10.1145\/195058.195216"},{"issue":"4","key":"19_CR3","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"M. X. Goemans","year":"1994","unstructured":"Michel X. Goemans and David P. Williamson. New 3\/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal of Disc. Math., 7(4):656\u2013666, November 1994.","journal-title":"SIAM Journal of Disc. Math."},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. S. Johnson","year":"1974","unstructured":"David S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Comput. and Sys. Sci., 9:256\u2013278, 1974.","journal-title":"Journal of Comput. and Sys. Sci."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. In Proc. 20th STOC, pages 229\u2013234, 1988.","DOI":"10.1145\/62212.62233"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Pravin M. Vaidya. A new algorithm for minimizing convex function over convex sets. In Proc. 30th FOCS, pages 338\u2013343, 1989.","DOI":"10.1109\/SFCS.1989.63500"},{"key":"19_CR7","unstructured":"Mihalis Yannakakis. On the approximation of maximum satisfiability. In Proc. 3rd SODA, pages 1\u20139, 1992."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:49:41Z","timestamp":1586551781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605737","9783540477662"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0015420","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}