{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:56:56Z","timestamp":1742947016987,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"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_19","type":"book-chapter","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T22:09:57Z","timestamp":1639692597000},"page":"212-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Measured Continuous Greedy with\u00a0Differential Privacy"],"prefix":"10.1007","author":[{"given":"Xin","family":"Sun","sequence":"first","affiliation":[]},{"given":"Gaidi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yapu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhenning","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,17]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M.: Deep learning with differential privacy. In: Proceedings of the 23rd ACM SIGSAC Conference on Computer and Communications Security, pp. 308\u2013318 (2016)","DOI":"10.1145\/2976749.2978318"},{"key":"19_CR2","first-page":"307","volume-title":"The Probabilistic Method","author":"N Alon","year":"2004","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, vol. 3, pp. 307\u2013314. Wiley, New York (2004)"},{"key":"19_CR3","unstructured":"Bu, Z.Q., Gopi, S., Kulkarni, J., Lee, Y.T., Shen, J.H., Tantipongpipat, U.: Fast and memory efficient differentially private-SGD via JL projections. arXiv: 2102.03013 (2021)"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1287\/moor.2018.0955","volume":"44","author":"N Buchbinder","year":"2019","unstructured":"Buchbinder, N., Feldman, M.: Constrained submodular maximization via a non-symmetric technique. Math. Oper. Res. 44(3), 988\u20131005 (2019)","journal-title":"Math. Oper. Res."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J.S., Schwart, R.: Submodular maximization with cardinality constraints. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1433\u20131452 (2014)","DOI":"10.1137\/1.9781611973730.80"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"C$$\\breve{\\rm a}$$linescu, 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)","DOI":"10.1137\/080733991"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Jayram, T.S., Vondr\u00e1k, J.: On multiplicative weight updates for concave and submodular function maximization. In: Proceedings of the 6th Innovations in Theoretical Computer Science, pp. 201\u2013210 (2015)","DOI":"10.1145\/2688073.2688086"},{"key":"19_CR8","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Dependent randomized rounding for matroid polytopes and applications. In: Proceedings of the 51st Annual Symposium on Foundations of Computer Science, pp. 575\u2013584 (2010)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Multi-budgeted matchings and matroid intersection via dependent rounding. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1080\u20131097 (2011)","DOI":"10.1137\/1.9781611973082.82"},{"issue":"6","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1137\/110839655","volume":"43","author":"C Chekuri","year":"2014","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. SIAM J. Comput. 43(6), 1831\u20131879 (2014)","journal-title":"SIAM J. Comput."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_29"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Ene, A., Nguyen, H.L.: Constrained submodular maximization: beyond $$1\/e$$. In: Proceedings of the 57th Annual Symposium on Foundations of Computer Science, pp. 248\u2013257 (2016)","DOI":"10.1109\/FOCS.2016.34"},{"issue":"4","key":"19_CR13","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":"19_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: Proceedings of the 52nd Annual Symposium on Foundations of Computer Science, pp. 570\u2013579 (2011)","DOI":"10.1109\/FOCS.2011.46"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Gharan, S.O., Vondr\u00e1k, J.: Submodular maximization by simulated annealing. In: Proceedings of the 22 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1098\u20131116 (2011)","DOI":"10.1137\/1.9781611973082.83"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ligett, K., McSherry, F., Roth, A., Talwar, K.: Differentially private combinatorial optimization. In: Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1106\u20131125 (2010)","DOI":"10.1137\/1.9781611973075.90"},{"key":"19_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"},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1145\/502090.502093","volume":"48","author":"DS Hochbaum","year":"2001","unstructured":"Hochbaum, D.S.: An efficient algorithm for image segmentation, Markov random fields and related problems. J. ACM 48(4), 686\u2013701 (2001)","journal-title":"J. ACM"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"19_CR20","unstructured":"Krause, A., Guestrin, C.: Near-optimal nonmyopic value of information in graphical models. In: Proceedings of the 21st Conference in Uncertainty in Artificial Intelligence, pp. 324\u2013331 (2005)"},{"key":"19_CR21","unstructured":"Krause, A., Guestrin, C.: Near-optimal observation selection using submodular functions. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence, pp. 1650\u20131654 (2007)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. In: Proceedings of the 20th Annual ACM SIAM Symposium on Discrete Algorithms, pp. 545\u2013554 (2009)","DOI":"10.1137\/1.9781611973068.60"},{"key":"19_CR23","unstructured":"Lin, H., Bilmes, J.A.: A class of submodular functions for document summarization. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, pp. 510\u2013520 (2011)"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Lee, J., Mirrokni, V.S., Nagarajan, V., Sviridenko, M.: Non-monotone submodular maximization under matroid and knapsack constraints. In: Proceedings of the 41th Annual ACM Symposium on Theory of Computing, pp. 323\u2013332 (2009)","DOI":"10.1145\/1536414.1536459"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"19_CR26","unstructured":"Mirzasoleiman, B., Badanidiyuru, A., Karbasi, A.: Fast constrained submodular maximization: personalized data summarization. In: Proceedings of the 33rd International Conference on Machine Learning, pp. 1358\u20131367 (2016)"},{"key":"19_CR27","unstructured":"Mitrovic, M., Bun, M., Krause, A., Karbasi, A.: Differentially private submodular maximization: data summarization in disguise. In: Proceedings of the 34th International Conference on Machine Learning, pp. 2478\u20132487 (2017)"},{"issue":"3","key":"19_CR28","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."},{"issue":"1","key":"19_CR29","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."},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Schapira, M., Singer, Y.: On the hardness of being truthful. In: Proceedings of the 49th Annual Symposium on Foundations of Computer Science, pp. 250\u2013259 (2008)","DOI":"10.1109\/FOCS.2008.54"},{"key":"19_CR31","unstructured":"Rafiey, A., Yoshida, Y.: Fast and private submodular and $$k$$-submodular functions maximization with matroid constraints. In: Proceedings of the 37th International Conference on Machine Learning, pp. 7887\u20137897 (2020)"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Streeter, M.J., Golovin, D.: An online algorithm for maximizing submodular functions. In: Proceedings of the 22nd International Conference on Advances in Neural Information Processing Systems, pp. 1577\u20131584 (2008)","DOI":"10.21236\/ADA476748"},{"issue":"1","key":"19_CR33","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0167-6377(03)00062-2","volume":"32","author":"M Sviridenko","year":"2004","unstructured":"Sviridenko, M.: A note on maximizing a submodular set function subject to knapsack constraint. Oper. Res. Lett. 32(1), 41\u201343 (2004)","journal-title":"Oper. Res. Lett."},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 67\u201374 (2008)","DOI":"10.1145\/1374376.1374389"},{"issue":"1","key":"19_CR35","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1137\/110832318","volume":"42","author":"J Vondr\u00e1k","year":"2013","unstructured":"Vondr\u00e1k, J.: Symmetry and approximability of submodular maximization problems. SIAM J. Comput. 42(1), 265\u2013304 (2013)","journal-title":"SIAM J. Comput."},{"key":"19_CR36","doi-asserted-by":"crossref","unstructured":"Yoshida, Y.: Cheeger inequalities for submodular transformations. In: Proceedings of the 30th Annual ACM Symposium on Discrete Algorithms, pp. 2582\u20132601 (2019)","DOI":"10.1137\/1.9781611975482.160"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:46:01Z","timestamp":1641015961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93176-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030931759","9783030931766"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93176-6_19","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)"}}]}}