{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:51Z","timestamp":1725663771315},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_5","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:24:32Z","timestamp":1330244672000},"page":"40-53","source":"Crossref","is-referenced-by-count":8,"title":["New local search approximation techniques for maximum generalized satisfiability problems"],"prefix":"10.1007","author":[{"given":"Paola","family":"Alimonti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(80)90006-7","volume":"12","author":"G. Ausiello","year":"1980","unstructured":"G. Ausiello, A. Marchetti-Spaccamela, M. Protasi, Toward a Unified Approach for the Classification of NP-Complete Optimization Problems, Th. Comp. Sci.,12,(1980), 83\u201396.","journal-title":"Th. Comp. Sci."},{"key":"5_CR2","unstructured":"G.Ausiello, M. Protasi, NP Optimization Problems and Local Optima, Technical Report, Esprit Bra Alcom II, 1992."},{"key":"5_CR3","unstructured":"D. Bruschi, D. Joseph, and P. Young, A Structural Overview of NP Opimization Problems, Rapporto Interno n. 75\/90, Dip. di Scienze dell'Informazione, Univ. degli Studi di Milano, 1990."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"S. A. Cook, The Complexity of Theorem Proving Procedures, Proc. 3th. Annual ACM Symp. on Theory of Computing, (1971), 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"5_CR5","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Comleteness","author":"M. Garey","year":"1979","unstructured":"M. Garey, and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Comleteness, Freeman, San Francisco (1979)."},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P. Hansen","year":"1990","unstructured":"P. Hansen, and B. Jaumard, Algorithms for the Maximum Satisfiability Problem, Computing, 44, (1990), 279\u2013303","journal-title":"Computing"},{"key":"5_CR7","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, Approssimation Algorithms for Combinatorial Problems, J. Comp. Sys.,Sc.9, (1974),256\u2013278.","journal-title":"J. Comp. Sys.,Sc."},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D. S. Johnson","year":"1988","unstructured":"D.S. Johnson, C.H. Papadimitriou, M. Yannakakis, How Easy Is Local Search? Journal of Computer and System Sciences,37, (1988), 79\u2013100.","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR9","unstructured":"S. Khanna, R. R. Motwani, M. Sudan, U. Vazirani, On Sintactic versus Computational Views of Approximability, Manuscript, 1993."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(81)90081-5","volume":"15","author":"A. Paz","year":"1981","unstructured":"A. Paz, and S. Moran, Non Deterministic Polynomial Optimization Problems and their Approximation, Th. Comp. Sci.,15 (1981), 251\u2013277.","journal-title":"Th. Comp. Sci."},{"key":"5_CR11","volume-title":"Combinatorial Optimization Algorithms and Optimization","author":"C. Papadimitriou","year":"1982","unstructured":"C. Papadimitriou, and K. Steiglitz, Combinatorial Optimization Algorithms and Optimization, Prentice-Hall, Englewood Cliffs, New Jersey (1982)."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"C. Papadimitriou, and M. Yannakakis, Optimization, Approximation, and Complexity Classes, Proc. 20th. Annual ACM Symp. on Theory of Computing, (1988), 229\u2013234. To appear J.Comp.Sys.Sc.","DOI":"10.1145\/62212.62233"},{"key":"5_CR13","unstructured":"M. Yannakakis, On the Approximation of Maximum Satisfiability, Proc. 3rd Annual ACM Symp. on Discrete Algorithm, (1992),1\u20139."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:08:19Z","timestamp":1619557699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}