{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:30:49Z","timestamp":1742959849056,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648428"},{"type":"electronic","value":"9783030648435"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_42","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"624-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Novel Algorithms for Maximum DS Decomposition"],"prefix":"10.1007","author":[{"given":"Shengminjie","family":"Chen","sequence":"first","affiliation":[]},{"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"key":"42_CR1","unstructured":"Bai, W., Bilmes, J.A.: Greed is still good: maximizing monotone submodular+supermodular functions (2018)"},{"key":"42_CR2","doi-asserted-by":"publisher","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Schwartz, R.: A Tight Linear Time (1\/2)-Approximation for Unconstrained Submodular Maximization. IEEE Computer Society, USA (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.73","DOI":"10.1109\/FOCS.2012.73"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Schwartz, R.: Submodular Maximization with Cardinality Constraints. Society for Industrial and Applied Mathematics, USA (2014)","DOI":"10.1137\/1.9781611973402.106"},{"key":"42_CR4","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. Computer Science (2011)"},{"key":"42_CR5","doi-asserted-by":"publisher","unstructured":"Feldman, M., Naor, J.S., Schwartz, R.: A Unified Continuous Greedy Algorithm for Submodular Maximization. IEEE Computer Society, USA (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.46","DOI":"10.1109\/FOCS.2011.46"},{"issue":"1","key":"42_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"ML Fisher","year":"1978","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions-II. Math. Program. 8(1), 73\u201387 (1978)","journal-title":"Math. Program."},{"issue":"1","key":"42_CR7","first-page":"427","volume":"42","author":"D Golovin","year":"2012","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: theory and applications in active learning and stochastic optimization. J. Artif. Intell. Res. 42(1), 427\u2013486 (2012)","journal-title":"J. Artif. Intell. Res."},{"key":"42_CR8","doi-asserted-by":"publisher","unstructured":"Han, K., Xu, C., Gui, F., Tang, S., Huang, H., Luo, J.: Discount allocation for revenue maximization in online social networks, pp. 121\u2013130, June 2018. https:\/\/doi.org\/10.1145\/3209582.3209595","DOI":"10.1145\/3209582.3209595"},{"key":"42_CR9","unstructured":"Harshaw, C., Feldman, M., Ward, J., Karbasi, A.: Submodular maximization beyond non-negativity: guarantees, fast algorithms, and applications, vol. 2019-June, pp. 4684\u20134705. Long Beach, CA, United states (2019)"},{"key":"42_CR10","unstructured":"Horel, T., Singer, Y.: Maximization of approximately submodular functions. In: Advances in Neural Information Processing Systems (2016)"},{"key":"42_CR11","unstructured":"Iyer, R., Bilmes, J.: Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications. AUAI Press, Arlington, Virginia (2012)"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Jegelka, S., Bilmes, J.: Submodularity Beyond Submodular Energies: Coupling Edges in Graph Cuts. IEEE Computer Society (2011)","DOI":"10.1109\/CVPR.2011.5995589"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Kempe, D.: Maximizing the spread of influence through a social network. In: Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)","DOI":"10.1145\/956750.956769"},{"issue":"3","key":"42_CR14","first-page":"235","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., Singh, A., Guestrin, C.: Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies. J. Mach. Learn. Res. 9(3), 235\u2013284 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Li, X., Du, H.G., Pardalos, P.M.: A variation of ds decomposition in set function optimization. J. Comb. Optim. (2020)","DOI":"10.1007\/s10878-020-00560-w"},{"key":"42_CR16","unstructured":"Lin, H., Bilmes, J.: A Class of Submodular Functions for Document Summarization. Association for Computational Linguistics, USA (2011)"},{"issue":"2","key":"42_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.14778\/2850578.2850581","volume":"9","author":"W Lu","year":"2015","unstructured":"Lu, W., Chen, W., Lakshmanan, L.V.S.: From competition to complementarity: comparative influence diffusion and maximization. Proc. VLDB Endow. 9(2), 60\u201371 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-014-0792-y","volume":"152","author":"T Maehara","year":"2015","unstructured":"Maehara, T., Murota, K.: A framework of discrete dc programming by discrete convex analysis. Math. Program. 152, 435\u2013466 (2015)","journal-title":"Math. Program."},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(84)90003-9","volume":"7","author":"M Conforti","year":"1984","unstructured":"Conforti, M., Cornu\u00e9jols, G.: Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discret. Appl. Math. 7, 251\u2013274 (1984)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"42_CR20","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 functions-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"11","key":"42_CR21","doi-asserted-by":"publisher","first-page":"2374","DOI":"10.1109\/TKDE.2017.2740284","volume":"29","author":"Z Wang","year":"2017","unstructured":"Wang, Z., Yang, Y., Pei, J., Chu, L., Chen, E.: Activity maximization by effective information diffusion in social networks. IEEE Trans. Knowl. Data Eng. 29(11), 2374\u20132387 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"42_CR22","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10878-020-00629-6","volume":"40","author":"W Yang","year":"2020","unstructured":"Yang, W., Chen, S., Gao, S., Yan, R.: Boosting node activity by recommendations in social networks. J. Comb. Optim. 40(3), 825\u2013847 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00629-6","journal-title":"J. Comb. Optim."},{"issue":"4","key":"42_CR23","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s10878-020-00638-5","volume":"40","author":"W Yang","year":"2020","unstructured":"Yang, W., Zhang, Y., Du, D.-Z.: Influence maximization problem: properties and algorithms. J. Comb. Optim. 40(4), 907\u2013928 (2020). https:\/\/doi.org\/10.1007\/s10878-020-00638-5","journal-title":"J. Comb. Optim."},{"key":"42_CR24","unstructured":"Yu, J., Blaschko, M.: A convex surrogate operator for general non-modular loss functions, April 2016"},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Zhu, J., Ghosh, S., Zhu, J., Wu, W.: Near-optimal convergent approach for composed influence maximization problem in social networks. IEEE Access PP(99), 1 (2019)","DOI":"10.1109\/ACCESS.2019.2944207"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T17:15:04Z","timestamp":1607102104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","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":"55","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":"53% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}