{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:45:51Z","timestamp":1778715951238,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319711461","type":"print"},{"value":"9783319711478","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71147-8_7","type":"book-chapter","created":{"date-parts":[[2017,11,15]],"date-time":"2017-11-15T13:33:21Z","timestamp":1510752801000},"page":"94-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Improved Branching Algorithm for (n,\u00a03)-MaxSAT Based on Refined Observations"],"prefix":"10.1007","author":[{"given":"Wenjun","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,16]]},"reference":[{"issue":"4\u20135","key":"7_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10732-006-7234-9","volume":"12","author":"J Argelich","year":"2006","unstructured":"Argelich, J., Many\u00e0, F.: Exact Max-SAT solvers for over-constrained problems. J. Heuristics 12(4\u20135), 375\u2013392 (2006)","journal-title":"J. Heuristics"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-46632-0_26","volume-title":"Algorithms and Computation","author":"N Bansal","year":"1999","unstructured":"Bansal, N., Raman, V.: Upper bounds for MaxSat: further improved. ISAAC 1999. LNCS, vol. 1741, pp. 247\u2013258. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46632-0_26"},{"key":"7_CR3","unstructured":"Berg, J., Hyttinen, A., Jrvisalo, M.: Applications of MaxSAT in data analysis. In: Pragmatics of SAT Workshop (2015)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-33293-7_6","volume-title":"Parameterized and Exact Computation","author":"I Bliznets","year":"2012","unstructured":"Bliznets, I., Golovnev, A.: A new algorithm for parameterized MAX-SAT. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 37\u201348. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33293-7_6"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10958-012-1101-z","volume":"188","author":"IA Bliznets","year":"2013","unstructured":"Bliznets, I.A.: A new upper bound for $$(n, 3)$$-MAX-SAT. J. Math. Sci. 188(1), 1\u20136 (2013)","journal-title":"J. Math. Sci."},{"issue":"8\u20139","key":"7_CR6","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.artint.2007.03.001","volume":"171","author":"ML Bonet","year":"2007","unstructured":"Bonet, M.L., Levy, J., Many\u00e0, F.: Resolution for Max-SAT. Artif. Intell. 171(8\u20139), 606\u2013618 (2007)","journal-title":"Artif. Intell."},{"issue":"1\u20133","key":"7_CR7","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. Discret. Appl. Math. 142(1\u20133), 17\u201327 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"40\u201342","key":"7_CR8","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoret. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201\u2013215 (1960)","journal-title":"J. ACM"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Kratsch, D.: Exact exponential algorithms. In: Texts in Theoretical Computer Science. An EATCS Series, Chap. 2, pp. 13\u201330. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7","DOI":"10.1007\/978-3-642-16533-7"},{"key":"7_CR11","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D Hochbaum","year":"1997","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1997)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.09.006","volume":"243","author":"F Hutter","year":"2017","unstructured":"Hutter, F., Lindauer, M., Balint, A., Bayless, S., Hoos, H., Leyton-Brown, K.: The Configurable SAT Solver Challenge (CSSC). Artif. Intell. 243, 1\u201325 (2017)","journal-title":"Artif. Intell."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11499107_35","volume-title":"Theory and Applications of Satisfiability Testing","author":"AS Kulikov","year":"2005","unstructured":"Kulikov, A.S.: Automated generation of simplification rules for SAT and MAXSAT. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 430\u2013436. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11499107_35"},{"key":"7_CR14","unstructured":"Lokshtanov, D.: New methods in parameterized algorithms and complexity. Ph.D. thesis, University of Bergen (2009)"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/jagm.2000.1075","volume":"36","author":"R Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. J. Algorithms 36(1), 63\u201388 (2000)","journal-title":"J. Algorithms"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1137\/15M1053369","volume":"46","author":"M Poloczek","year":"2017","unstructured":"Poloczek, M., Schnitger, G., Williamson, D.P., van Zuylen, A.: Greedy algorithms for the maximum satisfiability problem: simple algorithms and inapproximability bounds. SIAM J. Comput. 46(3), 1029\u20131061 (2017)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(97)00223-8","volume":"65","author":"V Raman","year":"1998","unstructured":"Raman, V., Ravikumar, B., Rao, S.S.: A simplified NP-complete MAXSAT problem. Inf. Process. Lett. 65(1), 1\u20136 (1998)","journal-title":"Inf. Process. Lett."},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-18008-3_24","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"P Saikko","year":"2015","unstructured":"Saikko, P., Malone, B., J\u00e4rvisalo, M.: MaxSAT-based cutting planes for learning graphical models. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 347\u2013356. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_24"},{"issue":"4","key":"7_CR19","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10472-005-7036-z","volume":"44","author":"H Shen","year":"2005","unstructured":"Shen, H., Zhang, H.: Improving exact algorithms for MAX-2-SAT. Ann. Math. Artif. Intell. 44(4), 419\u2013436 (2005)","journal-title":"Ann. Math. Artif. Intell."},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.dam.2014.07.009","volume":"199","author":"M Xiao","year":"2016","unstructured":"Xiao, M., Nagamochi, H.: An exact algorithm for maximum independent set in degree-5 graphs. Discret. Appl. Math. 199, 137\u2013155 (2016)","journal-title":"Discret. Appl. Math."},{"key":"7_CR21","unstructured":"Xu, C., Chen, J., Wang, J.: Resolution and linear CNF formulas: improved $$(n, 3)$$-MaxSAT algorithms. Theor. Comput. Sci. (2016)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71147-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:11:08Z","timestamp":1709809868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71147-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711461","9783319711478"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71147-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}