{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:23:34Z","timestamp":1743150214694,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271947"},{"type":"electronic","value":"9783030271954"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-27195-4_30","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"329-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Two-Stage Constrained Submodular Maximization"],"prefix":"10.1007","author":[{"given":"Ruiqi","family":"Yang","sequence":"first","affiliation":[]},{"given":"Shuyang","family":"Gu","sequence":"additional","affiliation":[]},{"given":"Chuangen","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Badanidiyuru, A., Mirzasoleiman, B., Karbasi, A., Krause, A.: Streaming submodular maximization: massive data summarization on the fly. In: Proceedings of SIGKDD, pp. 671\u2013680 (2014)","DOI":"10.1145\/2623330.2623637"},{"key":"30_CR2","unstructured":"Balkanski, E., Mirzasoleiman, B., Krause, A., Singer, Y.: Learning sparse combinatorial representations via two-stage submodular maximization. In: Proceedings of ICML, pp. 2207\u20132216 (2016)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Garg, M.: Deterministic ($$1\/2$$+ $$\\varepsilon $$)-approximation for submodular maximization over a matroid. In: Proceedings of SODA, pp. 241\u2013254 (2019)","DOI":"10.1137\/1.9781611975482.16"},{"issue":"6","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40(6), 1740\u20131766 (2011)","journal-title":"SIAM J. Comput."},{"key":"30_CR5","unstructured":"Dasgupta, A., Kumar, R., Ravi, S.: Summarization through submodularity and dispersion. In: Proceedings of ACL, pp. 1014\u20131022 (2013)"},{"key":"30_CR6","unstructured":"Feldman, M., Harshaw, C., Karbasi, A.: Greed is good: near-optimal submodular maximization via greedy optimization. arXiv: 1704.01652 (2017)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0121195","volume-title":"Polyhedral Combinatorics","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. In: Balinski, M.L., Hoffman, A.J. (eds.) Polyhedral Combinatorics, pp. 73\u201387. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/BFb0121195"},{"key":"30_CR8","unstructured":"Gomes, R., Krause, A.: Budgeted nonparametric learning from data streams. In: Proceedings of ICML, pp. 391\u2013398 (2010)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of SIGKDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"4","key":"30_CR10","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1287\/moor.1100.0463","volume":"35","author":"J Lee","year":"2010","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Submodular maximization over multiple matroids via generalized exchange properties. Math. Oper. Res. 35(4), 795\u2013806 (2010)","journal-title":"Math. Oper. Res."},{"key":"30_CR11","unstructured":"Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: Proceedings of ACL, pp. 510\u2013520 (2011)"},{"key":"30_CR12","first-page":"528","volume-title":"Lecture Notes in Computer Science","author":"Juli\u00e1n Mestre","year":"2006","unstructured":"Mestre, J.: Greedy in approximation algorithms. In: Proceedings of ESA, pp. 528\u2013539 (2006)"},{"key":"30_CR13","unstructured":"Mitrovic, S., Bogunovic, I., Norouzi-Fard, A., Tarnawski, J.M., Cevher, V.: Streaming robust submodular maximization: a partitioned thresholding approach. In: Proceedings of NIPS, pp. 4557\u20134566 (2017)"},{"key":"30_CR14","unstructured":"Mitrovic, M., Kazemi, E., Zadimoghaddam, M., Karbasi, A.: Data summarization at scale: a two-stage submodular approach. arXiv preprint arXiv:1806.02815 (2018)"},{"issue":"1","key":"30_CR15","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 setfunctions-I. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"issue":"1","key":"30_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orl.2018.11.002","volume":"47","author":"KK Sarpatwar","year":"2019","unstructured":"Sarpatwar, K.K., Schieber, B., Shachnai, H.: Constrained submodular maximization via greedy local search. Oper. Res. Lett. 47(1), 1\u20136 (2019)","journal-title":"Oper. Res. Lett."},{"key":"30_CR17","unstructured":"Stan, S., Zadimoghaddam, M., Krause, A., Karbasi, A.: Probabilistic submodular maximization in sub-linear time. In: Proceedings of ICML, pp. 3241\u20133250 (2017)"},{"issue":"1","key":"30_CR18","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":"30_CR19","doi-asserted-by":"publisher","unstructured":"Wu, W.L., Zhang, Z., Du, D.Z.: Set function optimization. J. Oper. Res. Soc. China (2018). https:\/\/doi.org\/10.1007\/s40305018-0233-3","DOI":"10.1007\/s40305018-0233-3"}],"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-27195-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:18:25Z","timestamp":1709824705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"1 August 2019","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":"Beijing","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theory.ict.ac.cn\/aaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}