{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:08Z","timestamp":1725551648823},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638902"},{"type":"electronic","value":"9783540696629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63890-3_18","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T21:12:11Z","timestamp":1270501931000},"page":"153-162","source":"Crossref","is-referenced-by-count":4,"title":["A theoretical framework of hybrid approaches to MAX SAT"],"prefix":"10.1007","author":[{"given":"Takao","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuniaki","family":"Hori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomio","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"T. Asano, Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. Proc. 5th Israel Symposium on Theory of Computing and Systems, 1997, pp.24\u201337.","DOI":"10.1109\/ISTCS.1997.595154"},{"key":"18_CR2","first-page":"388","volume":"3","author":"T. Asano","year":"1996","unstructured":"T. Asano, T. Ono and T. Hirata, Approximation algorithms for the maximum satisfiability problem. Nordic Journal of Computing, 3 (1996), pp.388\u2013404.","journal-title":"Nordic Journal of Computing"},{"key":"18_CR3","unstructured":"T. Asano, K. Hori, T. Ono and T. Hirata, A refinement of Yannakakis's algorithm for MAX SAT. Information Processing Society of Japan, SIGAL-TR-54-11, 1996."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"U. Feige and M. X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. Proc. 3rd Israel Symposium on Theory of Computing and Systems, 1995, pp.182\u2013189.","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"M. X. Goemans","year":"1994","unstructured":"M. X. Goemans and D. P. Williamson, New \/34-approximation algorithms for the maximum satisfiability problem. SIAM J. Disc. Math., 7 (1994), pp.656\u2013666.","journal-title":"SIAM J. Disc. Math."},{"key":"18_CR6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. X. Goemans","year":"1995","unstructured":"M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42 (1995), pp.1115\u20131145.","journal-title":"Journal of the ACM"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"M. Yannakakis, On the approximation of maximum satisfiability. Proc. 3rd SODA, 1992, pp.l\u20139 (and also J. Algorithms, 17 (1994), pp.475\u2013502).","DOI":"10.1006\/jagm.1994.1045"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63890-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T16:23:21Z","timestamp":1549211001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63890-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638902","9783540696629"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-63890-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}