{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:28:19Z","timestamp":1743010099098,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030914332"},{"type":"electronic","value":"9783030914349"}],"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-91434-9_5","type":"book-chapter","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T07:04:42Z","timestamp":1638515082000},"page":"50-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithm for Maximizing Nonnegative Weakly Monotonic Set Functions"],"prefix":"10.1007","author":[{"given":"Min","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruiqi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,4]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: 20th International Proceedings on Knowledge Discovery and Data Mining, New York, NY, USA, pp. 671\u2013680. Association for Computing Machinery (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"5_CR2","unstructured":"Bian, A.A., Buhmann, J.M., Krause, A., Tschiatschek, S.: Guarantees for Greedy maximization of non-submodular functions with applications. In: 35th International Conference on Machine Learning, NSW, Australia, vol. 70, pp. 498\u2013507. Proceedings of Machine Learning Research (2017)"},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1137\/130929205","volume":"44","author":"N Buchbinder","year":"2015","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. SIAM J. Comput. 44(5), 1384\u20131402 (2015)","journal-title":"SIAM J. Comput."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M.: Deterministic algorithms for submodular maximization problems. In: 27th International Symposium on Discrete Algorithms, Arlington, VA, USA, pp. 392\u2013403. Society for Industrial and Applied Mathematics (2016)","DOI":"10.1137\/1.9781611974331.ch29"},{"key":"5_CR5","unstructured":"Cherenin, V.: Solving some combinatorial problems of optimal planning by the method of successive calculations. In: Conference of Experiences and Perspectives of the Applications of Mathematical Methods and Electronic Computers in Planning, Russian, Mimeograph, Novosibirsk (1962)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1016\/j.cor.2016.09.008","volume":"78","author":"VN Coelho","year":"2017","unstructured":"Coelho, V.N., et al.: Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign. Comput. Oper. Res. 78, 578\u2013587 (2017)","journal-title":"Comput. Oper. Res."},{"key":"5_CR7","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In: 28th International Conference on Machine Learning, Bellevue, Washington, USA, pp. 1057\u20131064. Omnipress (2011)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Dobzinski, S., Vondrak, J.: From query complexity to computational complexity. In: 44th International Symposium on Theory of Computing, New York, NY, USA, pp. 1107\u20131116. Society for Industrial and Applied Mathematics (2012)","DOI":"10.1145\/2213977.2214076"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1137\/090779346","volume":"40","author":"U Feige","year":"2011","unstructured":"Feige, U., Mirrokni, V.S., Vondr\u00e1k, J.: Maximizing non-monotone submodular functions. SIAM J. Comput. 40(4), 1133\u20131153 (2011)","journal-title":"SIAM J. Comput."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-22006-7_29","volume-title":"Automata, Languages and Programming","author":"M Feldman","year":"2011","unstructured":"Feldman, M., Naor, J.S., Schwartz, R.: Nonmonotone submodular maximization via a structural continuous Greedy algorithm. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 342\u2013353. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_29"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2007.05.036","volume":"385","author":"G Galbiati","year":"2007","unstructured":"Galbiati, G., Maffioli, F.: Approximation algorithms for maximum cut with limited unbalance. Theor. Comput. Sci. 385(1), 78\u201387 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Gharan, S.O., Vondr\u00e1k, J.: Submodular maximization by simulated annealing. In: 22nd International Symposium on Discrete Algorithms, San Francisco, California, USA, pp. 1098\u20131116. Society for Industrial and Applied Mathematics (2011)","DOI":"10.1137\/1.9781611973082.83"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1007\/s10898-019-00800-2","volume":"75","author":"S Gong","year":"2019","unstructured":"Gong, S., Nong, Q., Liu, W., Fang, Q.: Parametric monotone function maximization with matroid constraints. J. Global Optim. 75(3), 833\u2013849 (2019). https:\/\/doi.org\/10.1007\/s10898-019-00800-2","journal-title":"J. Global Optim."},{"key":"5_CR14","unstructured":"Halperin, E., Zwick, U.: Combinatorial approximation algorithms for the maximum directed cut problem. In: 20th International Symposium on Discrete Algorithms, Washington, DC, USA, pp. 1\u20137. Association for Computing Machinery\/Society for Industrial and Applied Mathematics (2001)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Hartline, J., Mirrokni, V., Sundararajan, M.: Optimal marketing strategies over social networks. In: 17th International Proceedings on World Wide Web, Beijing, China, pp. 189\u2013198. Association for Computing Machinery (2008)","DOI":"10.1145\/1367497.1367524"},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. Assoc. Comput. Mach. 48(4), 761\u2013777 (2001)","journal-title":"J. Assoc. Comput. Mach."},{"key":"5_CR17","unstructured":"Mansell, R., Collins, B.S.: Introduction: Trust and Crime in Information Societies. Edward Elgar (2005)"},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2008.05.007","volume":"196","author":"MT Melo","year":"2009","unstructured":"Melo, M.T., Nickel, S., Saldanha-da-Gama, F.: Facility location and supply chain management - a review. Eur. J. Oper. Res. 196(2), 401\u2013412 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: 30th International Symposium on Theory of Computing, San Diego, California, USA, pp. 128\u2013134. Association for Computing Machinery (2007)","DOI":"10.1145\/1250790.1250811"},{"key":"5_CR20","unstructured":"Roughgarden, T., Wang, J.: An optimal learning algorithm for online unconstrained submodular maximization. In: 31st International Conference on Learning Theory, Stockholm, Sweden, pp. 1307\u20131325. Proceedings of Machine Learning Research (2018)"},{"issue":"24","key":"5_CR21","doi-asserted-by":"publisher","first-page":"5474","DOI":"10.3390\/s19245474","volume":"19","author":"AK Tran","year":"2019","unstructured":"Tran, A.K., Piran, M.J., Pham, C.: SDN controller placement in IoT networks: an optimized submodularity-based approach. Sensors 19(24), 5474 (2019)","journal-title":"Sensors"},{"issue":"9","key":"5_CR22","doi-asserted-by":"publisher","first-page":"2591","DOI":"10.3390\/s20092591","volume":"20","author":"Y-C Tsai","year":"2020","unstructured":"Tsai, Y.-C., Tseng, K.-S.: Deep compressed sensing for learning submodular functions. Sensors 20(9), 2591 (2020)","journal-title":"Sensors"},{"issue":"40","key":"5_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.2307\/2549830","volume":"10","author":"SC Tsiang","year":"1943","unstructured":"Tsiang, S.C.: A note on speculation and income stability. Economica 10(40), 27\u201347 (1943)","journal-title":"Economica"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, H., Vorobeychik, Y.: Submodular optimization with routing constraints. In: 30th International Proceedings on Artificial Intelligence, Phoenix, Arizona, USA, pp. 819\u2013825. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10066"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91434-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:40:23Z","timestamp":1710232823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91434-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030914332","9783030914349"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91434-9_5","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":"4 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","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":"15 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/","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":"57","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":"24","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":"8","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":"42% - 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":"6","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)"}}]}}