{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,3]],"date-time":"2026-01-03T15:11:46Z","timestamp":1767453106849,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_17","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T19:07:11Z","timestamp":1227640031000},"page":"187-198","source":"Crossref","is-referenced-by-count":4,"title":["Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodo","family":"Manthey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/3-540-48777-8_2","volume-title":"Proc. of the 7th Int. Conf. on Integer Programming and Combinatorial Optimization (IPCO)","author":"A. A. Ageev","year":"1999","unstructured":"A. A. Ageev and M. I. Sviridenko. Approximation algorithms for maximum coverage and max cut with given sizes of parts. In Proc. of the 7th Int. Conf. on Integer Programming and Combinatorial Optimization (IPCO), volume 1620 of Lecture Notes in Comput. Sci., pages 17\u201330. Springer, 1999."},{"key":"17_CR2","unstructured":"N. A1on, J. H. Spencer, and P. Erd\u00f6s. The Probabilistic Method. John Wiley and Sons, 1992."},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/jagm.2001.1202","volume":"42","author":"T. Asano","year":"2002","unstructured":"T. Asano and D. P. Williamson. Improved approximation algorithms for MAX SAT. J. Algorithms, 42(1):173\u2013202, 2002.","journal-title":"J. Algorithms"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G. P. Cornu\u00e9jols","year":"1977","unstructured":"G. P. Cornu\u00e9jols, M. L. Fisher, and G. L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23:789\u2013810, 1977.","journal-title":"Management Science"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634\u2013652, 1998.","journal-title":"J. ACM"},{"key":"17_CR7","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. In Proc. of the 3rd Israel Symp. on the Theory of Comput. and Systems (ISTCS), pages 182\u2013189, 1995.","DOI":"10.1109\/ISTCS.1995.377033"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","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. Discrete Math., 7(4):656\u2013666, 1994.","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"17_CR9","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u222eastad","year":"2001","unstructured":"J. H\u222eastad. Some optimal inapproximability results. J. ACM, 48(4):798\u2013859, 2001.","journal-title":"J. ACM"},{"issue":"3","key":"17_CR10","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/s00453-001-0019-5","volume":"30","author":"M. I. Sviridenko","year":"2001","unstructured":"M. I. Sviridenko. Best possible approximation algorithm for MAX SAT with cardinality constraint. Algorithmica, 30(3):398\u2013405, 2001.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,4]],"date-time":"2025-02-04T17:06:44Z","timestamp":1738688804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}