{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:56:05Z","timestamp":1743144965121,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030931759"},{"type":"electronic","value":"9783030931766"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93176-6_16","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"179-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bi-criteria Adaptive Algorithms for\u00a0Minimizing Supermodular Functions with\u00a0Cardinality Constraint"],"prefix":"10.1007","author":[{"given":"Xiaojuan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Balkanski, E., Rubinstein, A., Singer, Y.: An exponential speedup in parallel running time for submodular maximization without loss in approximation. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 283\u2013302. Society for Industrial and Applied Mathematics (2019). https:\/\/doi.org\/10.5555\/3310435.3310454","DOI":"10.5555\/3310435.3310454"},{"key":"16_CR2","unstructured":"Liberty, E., Sviridenko, M.: Greedy minimization of weakly supermodular set functions. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2017), vol. 81, pp. 19:1\u201319:11. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"1","key":"16_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set function\u2014I. Math. Program. 14(1), 265\u2013294 (1978). https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math. Program."},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177\u2013188 (1978)","journal-title":"Math. Oper. Res."},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Balkanski, E., Singer, Y.: The adaptive complexity of maximizing a submodular function. In: Proceedings of the Annual ACM SIGACT Symposium on Theory of Computing, pp. 1138\u20131151. Association for Computing Machinery, Los Angeles (2018). https:\/\/doi.org\/10.1145\/3188745.3188752","DOI":"10.1145\/3188745.3188752"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/moor.2016.0842","volume":"42","author":"M Sviridenko","year":"2017","unstructured":"Sviridenko, M., Vondr\u00e1k, J., Ward, J.: Optimal approximation for submodular and supermodular optimization with bounded curvature. Math. Oper. Res. 42(4), 1197\u20131218 (2017)","journal-title":"Math. Oper. Res."},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Ene, A., Nguy$$\\tilde{\\hat{e}}$$n, H.L.: Submodular maximization with nearly-optimal approximation and adaptivity in nearly-linear time. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 274\u2013282. Society for Industrial and Applied Mathematics (2019). https:\/\/doi.org\/10.1137\/1.9781611975482","DOI":"10.1137\/1.9781611975482"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Chekuri, C., Quanrud, K.: Submodular function maximization in parallel via the multilinear relaxation. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 303\u2013322. Society for Industrial and Applied Mathematics (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.20","DOI":"10.1137\/1.9781611975482.20"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/opre.2020.1992","volume":"69","author":"X Chen","year":"2021","unstructured":"Chen, X., Long, D.Z., Qi, J.: Preservation of supermodularity in parametric optimization: necessary and sufficient conditions on constraint structures. Oper. Res. 69(1), 1\u201312 (2021)","journal-title":"Oper. Res."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"107307","DOI":"10.1016\/j.compchemeng.2021.107307","volume":"149","author":"B Liu","year":"2021","unstructured":"Liu, B., Zhang, Q., Yuan, Z.: Two-stage distributionally robust optimization for maritime inventory routing. Comput. Chem. Eng. 149, 107307 (2021)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1080\/01969727308546046","volume":"3","author":"J Dunn","year":"1973","unstructured":"Dunn, J.: A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. J. Cybern. 3(3), 32\u201357 (1973)","journal-title":"J. Cybern."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Zass, R., Shashua, A.: A unifying approach to hard and probabilistic clustering. In: Proceedings of ICCV, vol. 1, pp. 294\u2013301 (2005)","DOI":"10.1109\/ICCV.2005.27"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93176-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:45:29Z","timestamp":1641015929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2021\/","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"38","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":"61% - 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":"3","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)"}}]}}