{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:36:34Z","timestamp":1742927794903,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_17","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"186-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting Maximum Satisfiability and\u00a0Related Problems in\u00a0Data Streams"],"prefix":"10.1007","author":[{"given":"Hoa T.","family":"Vu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"17_CR1","unstructured":"Maxsat evaluation (2021). https:\/\/maxsat-evaluations.github.io\/2021\/index.html"},{"key":"17_CR2","unstructured":"Agrawal, A., et al.: Parameterized streaming algorithms for min-ones d-sat. In: FSTTCS. LIPIcs, vol. 150, pp. 8:1\u20138:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Argelich, J., Berre, D.L., Lynce, I., Silva, J.P.M., Rapicault, P.: Solving Linux upgradeability problems using Boolean optimization. In: LoCoCo. EPTCS, vol. 29, pp. 11\u201322 (2010)","DOI":"10.4204\/EPTCS.29.2"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-72788-0_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"J Argelich","year":"2007","unstructured":"Argelich, J., Many\u00e0, F.: Partial Max-SAT solvers with clause learning. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 28\u201340. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72788-0_7"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-030-39219-2_23","volume-title":"Algorithms and Discrete Applied Mathematics","author":"U Arif","year":"2020","unstructured":"Arif, U., Benkoczi, R., Gaur, D.R., Krishnamurti, R.: On the minimum satisfiability problem. In: Changat, M., Das, S. (eds.) CALDAM 2020. LNCS, vol. 12016, pp. 269\u2013281. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39219-2_23"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Assadi, S., Chen, Y., Khanna, S.: Sublinear algorithms for ($$\\Delta $$ + 1) vertex coloring. In: SODA, pp. 767\u2013786. SIAM (2019)","DOI":"10.1137\/1.9781611975482.48"},{"key":"17_CR7","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. 3879, pp. 27\u201340. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671411_3"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-36136-7_41","volume-title":"Algorithms and Computation","author":"A Avidor","year":"2002","unstructured":"Avidor, A., Zwick, U.: Approximating MIN k-SAT. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 465\u2013475. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36136-7_41"},{"key":"17_CR9","unstructured":"Bera, S.K., Chakrabarti, A., Ghosh, P.: Graph coloring via degeneracy in streaming and other space-conscious models. In: ICALP. LIPIcs, vol. 168, pp. 11:1\u201311:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020)"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0167-6377(99)00010-3","volume":"24","author":"D Bertsimas","year":"1999","unstructured":"Bertsimas, D., Teo, C., Vohra, R.: On dependent randomized rounding algorithms. Oper. Res. Lett. 24(3), 105\u2013114 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"11","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1109\/TCAD.2010.2061270","volume":"29","author":"Y Chen","year":"2010","unstructured":"Chen, Y., Safarpour, S., Marques-Silva, J., Veneris, A.G.: Automated design debugging with maximum satisfiability. IEEE Trans. CAD Integr. Circ. Syst. 29(11), 1804\u20131817 (2010)","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"17_CR12","unstructured":"Chou, C.N., Golovnev, A., Sudan, M., Velusamy, S.: Approximability of all Boolean CSPs in the dynamic streaming setting (2021)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Chou, C., Golovnev, A., Velusamy, S.: Optimal streaming approximations for all Boolean Max-2CSPs and Max-kSAT. In: FOCS, pp. 330\u2013341. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00039"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"17_CR15","unstructured":"Cussens, J.: Bayesian network learning by compiling to weighted MAX-SAT. In: UAI, pp. 105\u2013112. AUAI Press (2008)"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified np-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"17_CR17","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"MX Goemans","year":"1994","unstructured":"Goemans, M.X., Williamson, D.P.: New 3\/4-approximation algorithms for the maximum satisfiability problem. SIAM J. Discrete Math. 7(4), 656\u2013666 (1994)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"17_CR19","unstructured":"Guruswami, V., Velingker, A., Velusamy, S.: Streaming complexity of approximating Max 2CSP and max acyclic subgraph. In: APPROX-RANDOM. LIPIcs, vol. 81, pp. 8:1\u20138:19. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"4","key":"17_CR20","doi-asserted-by":"publisher","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. ACM 48(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.ijar.2017.07.009","volume":"90","author":"A Hyttinen","year":"2017","unstructured":"Hyttinen, A., Plis, S.M., J\u00e4rvisalo, M., Eberhardt, F., Danks, D.: A constraint optimization approach to causal discovery from subsampled time series data. Int. J. Approx. Reason. 90, 208\u2013225 (2017)","journal-title":"Int. J. Approx. Reason."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Jackson, D., Schechter, I., Shlyakhter, I.: Alcoa: the alloy constraint analyzer. In: ICSE, pp. 730\u2013733. ACM (2000)","DOI":"10.1145\/337180.337616"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Jayaram, R., Woodruff, D.P.: Perfect lp sampling in a data stream. In: FOCS, pp. 544\u2013555. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00058"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Jowhari, H., Saglam, M., Tardos, G.: Tight bounds for lp samplers, finding duplicates in streams, and related problems. In: PODS, pp. 49\u201358. ACM (2011)","DOI":"10.1145\/1989284.1989289"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Krachun, D.: An optimal space lower bound for approximating MAX-CUT. In: STOC, pp. 277\u2013288. ACM (2019)","DOI":"10.1145\/3313276.3316364"},{"issue":"2","key":"17_CR26","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1137\/S0895480191220836","volume":"7","author":"R Kohli","year":"1994","unstructured":"Kohli, R., Krishnamurti, R., Mirchandani, P.: The minimum satisfiability problem. SIAM J. Discret. Math. 7(2), 275\u2013283 (1994)","journal-title":"SIAM J. Discret. Math."},{"key":"17_CR27","unstructured":"Li, C.M., Zhu, Z., Many\u00e0, F., Simon, L.: Minimum satisfiability and its applications. In: IJCAI, pp. 605\u2013610. IJCAI\/AAAI (2011)"},{"key":"17_CR28","unstructured":"Lynce, I., Marques-Silva, J.: Efficient haplotype inference with Boolean satisfiability. In: AAAI, pp. 104\u2013109. AAAI Press (2006)"},{"issue":"1","key":"17_CR29","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(96)00031-2","volume":"58","author":"MV Marathe","year":"1996","unstructured":"Marathe, M.V., Ravi, S.S.: On approximation algorithms for the minimum satisfiability problem. Inf. Process. Lett. 58(1), 23\u201329 (1996)","journal-title":"Inf. Process. Lett."},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.: Practical applications of Boolean satisfiability. In: 2008 9th International Workshop on Discrete Event Systems, pp. 74\u201380. IEEE (2008)","DOI":"10.1109\/WODES.2008.4605925"},{"key":"17_CR31","unstructured":"Marques-Silva, J., Janota, M., Ignatiev, A., Morgado, A.: Efficient model based diagnosis with maximum satisfiability. In: IJCAI, pp. 1966\u20131972. AAAI Press (2015)"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-662-48054-0_39","volume-title":"Mathematical Foundations of Computer Science 2015","author":"A McGregor","year":"2015","unstructured":"McGregor, A., Tench, D., Vorotnikova, S., Vu, H.T.: Densest subgraph in dynamic graph streams. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 472\u2013482. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48054-0_39"},{"issue":"3","key":"17_CR33","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."},{"key":"17_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-319-63387-9_4","volume-title":"Computer Aided Verification","author":"X Si","year":"2017","unstructured":"Si, X., Zhang, X., Grigore, R., Naik, M.: Maximum satisfiability in software analysis: applications and techniques. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 68\u201394. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_4"},{"issue":"4","key":"17_CR35","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","volume":"6","author":"BA Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, B.A.: A survey of Russian approaches to Perebor (brute-force searches) algorithms. IEEE Ann. Hist. Comput. 6(4), 384\u2013400 (1984)","journal-title":"IEEE Ann. Hist. Comput."},{"issue":"1","key":"17_CR36","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/PL00009209","volume":"21","author":"L Trevisan","year":"1998","unstructured":"Trevisan, L.: Parallel approximation algorithms by positive linear programming. Algorithmica 21(1), 72\u201388 (1998)","journal-title":"Algorithmica"},{"issue":"1","key":"17_CR37","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."},{"key":"17_CR38","doi-asserted-by":"crossref","unstructured":"Vu, H.T.: Revisiting maximum satisfiability and related problems in data streams (2022). https:\/\/arxiv.org\/abs\/2208.09160","DOI":"10.1007\/978-3-031-22105-7_17"},{"issue":"3","key":"17_CR39","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jagm.1994.1045","volume":"17","author":"M Yannakakis","year":"1994","unstructured":"Yannakakis, M.: On the approximation of maximum satisfiability. J. Algorithms 17(3), 475\u2013502 (1994)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22105-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:04:36Z","timestamp":1680213876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}