{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:12:32Z","timestamp":1742933552374,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819977420"},{"type":"electronic","value":"9789819977437"}],"license":[{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"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-99-7743-7_1","type":"book-chapter","created":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T09:02:16Z","timestamp":1700902936000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nonmonotone Submodular Maximization Under Routing Constraints"],"prefix":"10.1007","author":[{"given":"Haotian","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Rao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zewei","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Guodong","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"unstructured":"Krause, A., Golovin, D.: Submodular function maximization, chapter tractability: practical approaches to hard problems, pp. 3\u201319. Cambridge University Press (2012)","key":"1_CR1"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/j.neucom.2018.05.110","volume":"313","author":"K Wu","year":"2018","unstructured":"Wu, K., Cai, D., He, X.: Multi-label active learning based on submodular functions. Neurocomputing 313, 436\u2013442 (2018)","journal-title":"Neurocomputing"},{"unstructured":"Bilmes, J.: submodularity in machine learning and artificial intelligence (2022). https:\/\/arxiv.org\/pdf\/2202.00132v1.pdf","key":"1_CR3"},{"doi-asserted-by":"crossref","unstructured":"Wu, T., Yang, P., Dai, H., Xu, W., Xu, M.: Collaborated tasks-driven mobile charging and scheduling: a near optimal result. In: IEEE Conference on Computer Communications (INFOCOM), pp. 1810\u20131818 (2019)","key":"1_CR4","DOI":"10.1109\/INFOCOM.2019.8737509"},{"doi-asserted-by":"crossref","unstructured":"Amantidis, G., Kleer, P., Schafer, G.: Budget-feasible mechanism design for non-monotone submodular objectives: offline and online. In: the 2019 ACM Conference on Economics and Computation, pp. 901\u2013919 (2019)","key":"1_CR5","DOI":"10.1145\/3328526.3329622"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"5230","DOI":"10.1109\/LRA.2022.3149043","volume":"7","author":"K Jakkala","year":"2022","unstructured":"Jakkala, K., Akella, S.: Probabilistic gas leak rate estimation using submodular function maximizationwith routing constraints. IEEE Robot. Autom. Lett. 7(2), 5230\u20135237 (2022)","journal-title":"IEEE Robot. Autom. Lett."},{"doi-asserted-by":"crossref","unstructured":"Durr, C., Thang, N., Srivastav, A., Tible, L.: Non-monotone DR-submodular maximization over general convex sets. In: The Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI), pp. 2148\u20132157 (2020)","key":"1_CR7","DOI":"10.24963\/ijcai.2020\/297"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.3.3.177","volume":"3","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L.: Best algorithms for approximating the maximum of a submodular set function. Math. Oper. Res. 3(3), 177\u2013188 (1978)","journal-title":"Math. Oper. Res."},{"unstructured":"Krause, A., Guestrin, C.: Near-optimal nonmyopic value of information in graphical models. In: The Nineteenth International Joint Conference on Artificial Intelligence (IJCAI), pp. 324\u2013331 (2005)","key":"1_CR9"},{"issue":"6","key":"1_CR10","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., Pal, M., Vondrak, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Vondrak, J.: Fast algorithms for maximizing submodular functions. In: The 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1497\u20131514 (2014)","key":"1_CR11","DOI":"10.1137\/1.9781611973402.110"},{"doi-asserted-by":"crossref","unstructured":"Zhang, H., Vorobeychik, Y.: Submodular optimization with routing constraints. In: AAAI (2016)","key":"1_CR12","DOI":"10.1609\/aaai.v30i1.10066"},{"doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. In: The 53rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 649\u2013658 (2012)","key":"1_CR13","DOI":"10.1109\/FOCS.2012.73"},{"doi-asserted-by":"crossref","unstructured":"Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), Palm Springs, CA, USA, pp. 570\u2013579 (2011)","key":"1_CR14","DOI":"10.1109\/FOCS.2011.46"},{"doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J., Schwarts, R.: Submodular maximization with cardinality constraints. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1433\u20131452 (2014)","key":"1_CR15","DOI":"10.1137\/1.9781611973730.80"},{"doi-asserted-by":"crossref","unstructured":"Lee, J., Mirrokni, V., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization under matroid and knapsack constraints. In: STOC, Bethesda, Maryland, USA (2009)","key":"1_CR16","DOI":"10.1145\/1536414.1536459"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-17572-5_20","volume-title":"Internet and Network Economics","author":"A Gupta","year":"2010","unstructured":"Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: offline and secretary algorithms. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 246\u2013257. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_20"},{"unstructured":"Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A.: Fast constrained submodular maximization: personalized data summarization. In: The 33rd International Conference on Machine Learning (ICML), New York, USA (2016)","key":"1_CR18"},{"key":"1_CR19","first-page":"1","volume":"65","author":"M Feldman","year":"2017","unstructured":"Feldman, M., Harshaw, C., Karbasi, A.: Greed is good: near-optimal submodular maximization via greedy optimization. Proc. Mach. Learn. Res. 65, 1\u201327 (2017)","journal-title":"Proc. Mach. Learn. Res."},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s10878-020-00672-3","volume":"41","author":"M Shi","year":"2020","unstructured":"Shi, M., Yang, Z., Kim, D., Wang, W.: Non-monotone submodular function maximization under $$k$$-system constraint. J. Comb. Optim. 41(1), 128\u2013142 (2020)","journal-title":"J. Comb. Optim."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.tcs.2022.09.022","volume":"936","author":"S Tang","year":"2022","unstructured":"Tang, S.: Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and $$k$$-system constraints. Theoret. Comput. Sci. 936, 139\u2013147 (2022)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Balkanski, E., Singer, Y.: The adaptive complexity of maximizing a submodular function. In: The 50th Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1138\u20131151 (2018)","key":"1_CR22","DOI":"10.1145\/3188745.3188752"},{"unstructured":"Breuer, A., Balkanski, E., Singer, Y.: The fast algorithm for submodular maximization. In: The 37th International Conference on Machine Learning (ICML), Venna, Austria (2020)","key":"1_CR23"},{"unstructured":"Wang, S., Zhou, T., Lavania, C., Bilmes, J.: Constrained robust submodular partitioning. In: 35th Conference on Neural Information Processing Systems (NeurIPS), vol. 34, pp. 2721\u20132732. Curran Associates Inc. (2021)","key":"1_CR24"},{"key":"1_CR25","volume-title":"Submodular Functions and Optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization. Elsevier Science, Amsterdam (2005)"},{"unstructured":"Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, vol. 1, pp. 510\u2013520 (2011)","key":"1_CR26"},{"doi-asserted-by":"crossref","unstructured":"Mirzasoleiman, B., Jegelka, S., Krause, A.: Streaming non-monotone submodular maximization: personalized video summarization on the fly. In: The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI), pp. 1379\u20131386 (2018)","key":"1_CR27","DOI":"10.1609\/aaai.v32i1.11529"},{"unstructured":"Sharma, D., Deshpande, A., Kapoor, A.: On greedy maximization of entropy. In: The 32nd International Conference on Machine Learning (ICML), Lille, France (2015)","key":"1_CR28"},{"unstructured":"Bachman, P., Hjelm, D., Buchwalter, W.: Learning representations by maximizing mutual information across views. In: 33rd Conference on Neural Information Processing Systems (NeurIPS) (2019)","key":"1_CR29"},{"unstructured":"Tschannen, M., Djolonga, J., Rubenstein, P., Gelly, S., Lucic, M.: On mutual information maximization for representation learning. In the 8th International Conference on Learning Representations (ICLR) (2020)","key":"1_CR30"},{"unstructured":"Iyer, R., Bilmes, J.: Submodular optimization with submodular cover and submodular knapsack constraints. In: NIPS, Lake Tahoe, Nevada, USA (2013)","key":"1_CR31"},{"issue":"4","key":"1_CR32","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1137\/090779346","volume":"40","author":"U Feige","year":"2011","unstructured":"Feige, U., Mirrokni, V., Vondrak, J.: Maximizing non-monotone submodular functions. SIAM J. Comput. 40(4), 1133\u20131153 (2011)","journal-title":"SIAM J. Comput."},{"key":"1_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1701-9","volume-title":"Design and Analysis of Approximation Algorithms","author":"D Du","year":"2012","unstructured":"Du, D., Ko, K., Hu, X.: Design and Analysis of Approximation Algorithms. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4614-1701-9"}],"container-title":["Communications in Computer and Information Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-7743-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T09:03:53Z","timestamp":1700903033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-7743-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,26]]},"ISBN":["9789819977420","9789819977437"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-7743-7_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,11,26]]},"assertion":[{"value":"26 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NCTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"National Conference of Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nctcs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/TCS2023","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":"https:\/\/conf.ccf.org.cn\/TCS2023","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70","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":"16","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":"23% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The submission system is belonged to the hosted organization -China Computer Federation. It is free to us.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}