{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:26:38Z","timestamp":1743049598722,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642299513"},{"type":"electronic","value":"9783642299520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29952-0_23","type":"book-chapter","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T06:14:09Z","timestamp":1336025649000},"page":"202-213","source":"Crossref","is-referenced-by-count":2,"title":["Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms"],"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"}]},{"given":"Emeric","family":"Tourniaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"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. In: Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin (1999)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11671411_3","volume-title":"Approximation and Online Algorithms","author":"A. Avidor","year":"2006","unstructured":"Avidor, A., Berkovitch, I., Zwick, U.: Improved Approximation Algorithms for MAX\u00a0NAE-SAT and MAX\u00a0SAT. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 27\u201340. Springer, Heidelberg (2006)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Battiti, R., Protasi, M.: Algorithms and heuristics for max-sat. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol.\u00a01, pp. 77\u2013148. Kluwer Academic Publishers (1998)","DOI":"10.1007\/978-1-4613-0303-9_2"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A.: Determinant sums for undirected Hamiltonicity. In: Proc. FOCS 2010, pp. 173\u2013182. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.24"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A. Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J.\u00a0Comput.\u00a039(2), 546\u2013563 (2009)","journal-title":"SIAM J.\u00a0Comput."},{"issue":"17","key":"23_CR6","doi-asserted-by":"crossref","first-page":"1954","DOI":"10.1016\/j.dam.2011.07.009","volume":"159","author":"N. Bourgeois","year":"2011","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discrete Appl. Math.\u00a0159(17), 1954\u20131970 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"16","key":"23_CR7","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.ipl.2009.05.002","volume":"109","author":"N. Bourgeois","year":"2009","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Efficient approximation of min coloring by moderately exponential algorithms. Inform. Process. Lett.\u00a0109(16), 950\u2013954 (2009)","journal-title":"Inform. Process. Lett."},{"issue":"21-23","key":"23_CR8","doi-asserted-by":"publisher","first-page":"2184","DOI":"10.1016\/j.tcs.2009.02.007","volume":"410","author":"N. Bourgeois","year":"2009","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Efficient approximation of min set cover by moderately exponential algorithms. Theoret. Comput. Sci.\u00a0410(21-23), 2184\u20132195 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11847250_9","volume-title":"Parameterized and Exact Computation","author":"L. Cai","year":"2006","unstructured":"Cai, L., Huang, X.: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 96\u2013108. Springer, Heidelberg (2006)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.dam.2003.03.002","volume":"142","author":"J. Chen","year":"2004","unstructured":"Chen, J., Kanj, I.A.: Improved exact algorithms for max sat. Discrete Appl. Math.\u00a0142, 17\u201327 (2004)","journal-title":"Discrete Appl. Math."},{"key":"23_CR11","unstructured":"Crescenzi, P., Silvestri, R., Trevisan, L.: To weight or not to weight: where is the question? In: Proc. Israeli Symposium on Theory of Computing and Systems, ISTCS 1996, pp. 68\u201377. IEEE (1996)"},{"issue":"16","key":"23_CR12","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/j.ipl.2009.05.003","volume":"109","author":"M. Cygan","year":"2009","unstructured":"Cygan, M., Kowalik, L., Wykurz, M.: Exponential-time approximation of weighted set cover. Inform. Process. Lett.\u00a0109(16), 957\u2013961 (2009)","journal-title":"Inform. Process. Lett."},{"issue":"40-42","key":"23_CR13","doi-asserted-by":"publisher","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","volume":"411","author":"M. Cygan","year":"2010","unstructured":"Cygan, M., Pilipczuk, M.: Exact and approximate bandwidth. Theoret. Comput. Sci.\u00a0411(40-42), 3701\u20133713 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0168-0072(01)00052-5","volume":"113","author":"E. Dantsin","year":"2001","unstructured":"Dantsin, E., Gavrilovich, M., Hirsch, E.A., Konev, B.: max sat approximation beyond the limits of polynomial-time approximation. Ann. Pure and Appl. Logic\u00a0113, 81\u201394 (2001)","journal-title":"Ann. Pure and Appl. Logic"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/11847250_11","volume-title":"Parameterized and Exact Computation","author":"R.G. Downey","year":"2006","unstructured":"Downey, R.G., Fellows, M.R., McCartin, C.: Parameterized Approximation Problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 121\u2013129. Springer, Heidelberg (2006)"},{"issue":"1","key":"23_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.cosrev.2009.11.001","volume":"4","author":"B. Escoffier","year":"2010","unstructured":"Escoffier, B., Paschos, V.T.: A survey on the structure of approximation classes. Computer Science Review\u00a04(1), 19\u201340 (2010)","journal-title":"Computer Science Review"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Feige, U., Goemans, M.X.: Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In: Proc. 3rd Israel Symp. on Theory of Computing and Systems, pp. 182\u2013189. IEEE Computer Society (1995)","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-11269-0_14","volume-title":"Parameterized and Exact Computation","author":"M. F\u00fcrer","year":"2009","unstructured":"F\u00fcrer, M., Gaspers, S., Kasiviswanathan, S.P.: An Exponential Time 2-Approximation Algorithm for Bandwidth. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 173\u2013184. Springer, Heidelberg (2009)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. In: Proc. 29th Ann. ACM Symp. on Theory of Comp., pp. 1\u201310. ACM (1997)","DOI":"10.1145\/258533.258536"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0166-218X(02)00404-3","volume":"130","author":"E.A. Hirsch","year":"2003","unstructured":"Hirsch, E.A.: Worst-case study of local search for Max-k-SAT. Discrete Applied Mathematics\u00a0130, 173\u2013184 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the Complexity of k-SAT. J. Comput. Syst. Sci.\u00a062(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Moshkovitz, D., Raz, R.: Two-query PCP with subconstant error. J. ACM\u00a057(5) (2010)","DOI":"10.1145\/1754399.1754402"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29952-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:54:09Z","timestamp":1743044049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29952-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642299513","9783642299520"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29952-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}