{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:13:35Z","timestamp":1743020015190,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":18,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819705658"},{"type":"electronic","value":"9789819705665"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0566-5_10","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T12:03:28Z","timestamp":1709121808000},"page":"118-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On MAX\u2013SAT with\u00a0Cardinality Constraint"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6213-8687","authenticated-orcid":false,"given":"Fahad","family":"Panolan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0762-1398","authenticated-orcid":false,"given":"Hannane","family":"Yaghoubizade","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Austrin, P., Stankovic, A.: Global cardinality constraints make approximating some max-2-csps harder. In: Achlioptas, D., V\u00e9gh, L.A. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, 20\u201322 September 2019. LIPIcs, vol. 145, pp. 24:1\u201324:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2019.24","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2019.24"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994). https:\/\/doi.org\/10.1145\/174644.174650","journal-title":"J. ACM"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-36136-7_17","volume-title":"Algorithms and Computation","author":"M Bl\u00e4ser","year":"2002","unstructured":"Bl\u00e4ser, M., Manthey, B.: Improved approximation algorithms for max-2SAT with cardinality constraint. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 187\u2013198. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36136-7_17"},{"issue":"1\u20132","key":"10_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(98)00200-X","volume":"225","author":"P Crescenzi","year":"1999","unstructured":"Crescenzi, P., Trevisan, L.: Max np-completeness made easy. Theor. Comput. Sci. 225(1\u20132), 65\u201379 (1999). https:\/\/doi.org\/10.1016\/S0304-3975(98)00200-X","journal-title":"Theor. Comput. Sci."},{"key":"10_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"10_CR6","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, p. 632\u2013640. Society for Industrial and Applied Mathematics, USA (1995)"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634\u2013652 (1998). https:\/\/doi.org\/10.1145\/285055.285059","journal-title":"J. ACM"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781107415157","DOI":"10.1017\/9781107415157"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-39658-1_29","volume-title":"Algorithms - ESA 2003","author":"T Hofmeister","year":"2003","unstructured":"Hofmeister, T.: An approximation algorithm for MAX-2-SAT with cardinality constraint. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 301\u2013312. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_29"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Jain, P., et al.: Parameterized approximation scheme for biclique-free max $$k$$-weight SAT and max coverage, pp. 3713\u20133733. https:\/\/doi.org\/10.1137\/1.9781611977554.ch143. https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611977554.ch143","DOI":"10.1137\/1.9781611977554.ch143"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Khanna, S., Motwani, R.: Towards a syntactic characterization of ptas. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 329\u2013337. Association for Computing Machinery, New York (1996). https:\/\/doi.org\/10.1145\/237814.237979","DOI":"10.1145\/237814.237979"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Lokshtanov, D., Panolan, F., Ramanujan, M.S., Saurabh, S.: Lossy kernelization. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19\u201323 June 2017, pp. 224\u2013237. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055456","DOI":"10.1145\/3055399.3055456"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Manurangsi, P.: A note on max k-vertex cover: faster fpt-as, smaller approximate kernel and improved approximation. In: Fineman, J.T., Mitzenmacher, M. (eds.) 2nd Symposium on Simplicity in Algorithms, SOSA 2019, San Diego, CA, USA, 8\u20139 January 2019. OASIcs, vol. 69, pp. 15:1\u201315:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2019.15","DOI":"10.4230\/OASIcs.SOSA.2019.15"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Manurangsi, P.: Tight running time lower bounds for strong inapproximability of maximum k-coverage, unique set cover and related problems (via t-wise agreement testing theorem). In: Chawla, S. (ed.) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, 5\u20138 January 2020, pp. 62\u201381. SIAM (2020). https:\/\/doi.org\/10.1137\/1.9781611975994.5","DOI":"10.1137\/1.9781611975994.5"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60\u201378 (2008). https:\/\/doi.org\/10.1093\/comjnl\/bxm048","journal-title":"Comput. J."},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Panolan, F., Yaghoubizade, H.: Partial vertex cover on graphs of bounded degeneracy. In: Kulikov, A.S., Raskhodnikova, S. (eds.) Computer Science - Theory and Applications - 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, 29 June\u20131 July 2022, Proceedings. Lecture Notes in Computer Science, vol. 13296, pp. 289\u2013301. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-09574-0_18","DOI":"10.1007\/978-3-031-09574-0_18"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Raghavendra, P., Tan, N.: Approximating csps with global cardinality constraints using SDP hierarchies. In: Rabani, Y. (ed.) Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 373\u2013387. SIAM (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.33","DOI":"10.1137\/1.9781611973099.33"},{"issue":"3","key":"10_CR18","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/s00453-001-0019-5","volume":"30","author":"M Sviridenko","year":"2001","unstructured":"Sviridenko, M.: Best possible approximation algorithm for MAX SAT with cardinality constraint. Algorithmica 30(3), 398\u2013405 (2001). https:\/\/doi.org\/10.1007\/s00453-001-0019-5","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0566-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:08:27Z","timestamp":1709654907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0566-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819705658","9789819705665"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0566-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.walcom-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}