{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:03Z","timestamp":1725575223420},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258636"},{"type":"electronic","value":"9783540323099"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424925_22","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T11:14:27Z","timestamp":1295090067000},"page":"192-201","source":"Crossref","is-referenced-by-count":4,"title":["Differential Approximation of min sat, max sat and Related Problems"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Complexity and approximation. Combinatorial optimization problems and their approximability properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and approximation. Combinatorial optimization problems and their approximability properties. Springer, Berlin (1999)"},{"key":"22_CR2","volume-title":"Approximation algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation algorithms. Springer, Berlin (2001)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation and complexity classes. J. Comput. System Sci.\u00a043, 425\u2013440 (1991)","journal-title":"J. Comput. System Sci."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1137\/S0097539796304220","volume":"28","author":"P. Crescenzi","year":"1999","unstructured":"Crescenzi, P., Kann, V., Silvestri, R., Trevisan, L.: Structure in approximation classes. SIAM J. Comput.\u00a028, 1759\u20131782 (1999)","journal-title":"SIAM J. Comput."},{"key":"22_CR5","first-page":"1","volume":"7","author":"J.N. Hooker","year":"1988","unstructured":"Hooker, J.N.: Resolution vs. cutting plane solution of inference problems: some computational experience. Oper. Res. Lett.\u00a07, 1\u20137 (1988)","journal-title":"cutting plane solution of inference problems: some computational experience. Oper. Res. Lett."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02283686","volume":"25","author":"A.P. Kamath","year":"1990","unstructured":"Kamath, A.P., Karmarkar, N.K., Ramakrishnan, K.G., Resende, M.G.: Computational experience with an interior point algorithm on the satisfiability problem. Ann. Oper. Res.\u00a025, 43\u201358 (1990)","journal-title":"Ann. Oper. Res."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0377-2217(02)00299-0","volume":"147","author":"C. Bazgan","year":"2003","unstructured":"Bazgan, C., Paschos, V.T.: Differential approximation for optimal satisfiability and related problems. European J. Oper. Res.\u00a0147, 397\u2013404 (2003)","journal-title":"European J. Oper. Res."},{"key":"22_CR8","volume-title":"Approximation polynomiale des probl\u00e8mes NP-difficiles : optima locaux et rapport diff\u00e9rentiel","author":"J. Monnot","year":"2003","unstructured":"Monnot, J., Paschos, V.T., Toulouse, S.: Approximation polynomiale des probl\u00e8mes NP-difficiles: optima locaux et rapport diff\u00e9rentiel. Herm\u00e8s, Paris (2003)"},{"doi-asserted-by":"crossref","unstructured":"Escoffier, B., Paschos, V.T.: Differential approximation of MIN SAT, MAX SAT and related problems. In: Cahier du LAMSADE 220, LAMSADE, Universit\u00e9 Paris-Dauphine (2004)","key":"22_CR9","DOI":"10.1007\/11424925_22"},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. Assoc. Comput. Mach.\u00a048, 798\u2013859 (2001)","journal-title":"J. Assoc. Comput. Mach."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/3-540-61310-2_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"D. Bertsimas","year":"1996","unstructured":"Bertsimas, D., Teo, C.P., Vohra, R.: On dependent randomized rounding algorithms. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 330\u2013344. Springer, Heidelberg (1996)"},{"key":"22_CR12","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, San Francisco (1979)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424925_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:55:07Z","timestamp":1605624907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424925_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258636","9783540323099"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11424925_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}