{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T11:14:10Z","timestamp":1772882050398,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T00:00:00Z","timestamp":1713484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T00:00:00Z","timestamp":1713484800000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10878-024-01158-2","type":"journal-article","created":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T17:01:25Z","timestamp":1713546085000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Differentially private submodular maximization with a cardinality constraint over the integer lattice"],"prefix":"10.1007","volume":"47","author":[{"given":"Jiaming","family":"Hu","sequence":"first","affiliation":[]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2448-2158","authenticated-orcid":false,"given":"Cuixia","family":"Miao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,19]]},"reference":[{"key":"1158_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1146\/annurev-statistics-010422-034226","volume":"10","author":"JM Abowd","year":"2023","unstructured":"Abowd JM, Hawes MB (2023) Confidentiality protection in the $$2020$$ US Census of population and housing. Annu Rev Stat Appl 10:119\u2013144","journal-title":"Annu Rev Stat Appl"},{"key":"1158_CR2","unstructured":"Agrawal R, Squires C, Yang K, Shanmugam K, Uhler C (2019) Abcd-strategy: budgeted experimental design for targeted causal structure discovery. In: Proceedings of the 22nd international conference on artificial intelligence and statistics, pp 3400\u20133409"},{"key":"1158_CR3","doi-asserted-by":"crossref","unstructured":"Badanidiyuru A, Vondr\u00e1k J (2014) Fast algorithms for maximizing submodular functions. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, pp 1497\u20131514","DOI":"10.1137\/1.9781611973402.110"},{"key":"1158_CR4","unstructured":"Bian Y, Buhmann J, Krause A (2020) Optimal continuous DR-submodular maximization and applications to provable mean field inference. In: Proceedings of the 36th international conference on machine learning, pp 644\u2013653"},{"key":"1158_CR5","unstructured":"Bian A, Levy K, Krause A, Buhmann JM (2017) Non-monotone continuous DR-submodular maximization: Structure and algorithms. In: Proceedings of the 30th annual conference on neural information processing systems, pp 486\u2013496"},{"issue":"4","key":"1158_CR6","first-page":"319","volume":"1","author":"WD Blizard","year":"1991","unstructured":"Blizard WD (1991) The development of multiset theory. Mod Logic 1(4):319\u2013352","journal-title":"Mod Logic"},{"key":"1158_CR7","doi-asserted-by":"crossref","unstructured":"Buchbinder N, Feldman M, Naor J, Schwartz R (2014) Submodular maximization with cardinality constraints. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, pp 1433\u20131452","DOI":"10.1137\/1.9781611973730.80"},{"key":"1158_CR8","unstructured":"Chaturvedi A, Nguyen HL, Nguyen T (2023) Streaming submodular maximization with differential privacy. In: Proceedings of the 40th international conference on machine learning, pp 4116\u20134143"},{"key":"1158_CR9","doi-asserted-by":"crossref","unstructured":"Chaturvedi A, Nguyen HL, Zakynthinou L (2021) Differentially private decomposable submodular maximization. In: Proceedings of the 35th AAAI conference on artificial intelligence, pp 6984\u20136992","DOI":"10.1609\/aaai.v35i8.16860"},{"key":"1158_CR10","unstructured":"Chen L, Hassani H, Karbasi A (2018) Online continuous submodular maximization. In: Proceedings of the 21st international conference on artificial intelligence and statistics, pp 1896\u20131905"},{"key":"1158_CR11","doi-asserted-by":"crossref","unstructured":"Demaine ED, Hajiaghayi M, Mahini H, Malec DL, Raghavan S, Sawant A, Zadimoghadam M (2014) How to influence people with partial incentives. In: Proceedings of the 23rd international conference on world wide web, pp 937\u2013948","DOI":"10.1145\/2566486.2568039"},{"key":"1158_CR12","doi-asserted-by":"crossref","unstructured":"Dwork C, McSherry F, Nissim K, Smith AD (2006) Calibrating noise to sensitivity in private data analysis. In: Proceedings of the 3rd theory of cryptography conference, pp 265\u2013284","DOI":"10.1007\/11681878_14"},{"key":"1158_CR13","doi-asserted-by":"crossref","unstructured":"Gupta A, Ligett K, McSherry F, Roth A, Talwar K (2010) Differentially private combinatorial optimization. In: Proceedings of the 21st Annual ACM-SIAM symposium on discrete algorithms, pp 1106\u20131125","DOI":"10.1137\/1.9781611973075.90"},{"key":"1158_CR14","doi-asserted-by":"crossref","unstructured":"Harper FM, Konstan JA (2015) The movielens datasets: history and context. ACM Trans Interactive Intell Syst 19","DOI":"10.1145\/2827872"},{"key":"1158_CR15","unstructured":"Kuhnle A, Smith D, Crawford VG, Thai MT (2018) Fast maximization of non-submodular, monotonic functions on integer lattice. In: Proceedings of the 35th international conference on machine learning, pp 2786\u20132795"},{"key":"1158_CR16","doi-asserted-by":"crossref","unstructured":"Liu B, Chen Z, Wang H, Wu W (2021) Streaming algorithms for maximizing non-submodular functions on the integer lattice. In: Proceedings of the 10th international conference on computational data and social networks, pp 3\u201314","DOI":"10.1007\/978-3-030-91434-9_1"},{"key":"1158_CR17","doi-asserted-by":"crossref","unstructured":"McSherry F, Talwar K (2007) Mechanism design via differential privacy. In: Proceedings of the 48th annual IEEE symposium on foundations of computer science, pp 94\u2013103","DOI":"10.1109\/FOCS.2007.66"},{"key":"1158_CR18","unstructured":"Mitrovic M, Bun M, Krause A, Karbasi A (2017) Differentially private submodular maximization: data summarization in disguise. In: Proceedings of the 34th international conference on machine learning, pp 2478\u20132487"},{"key":"1158_CR19","doi-asserted-by":"crossref","unstructured":"Mirzasoleiman B, Badanidiyuru A, Karbasi A, Vondr\u00e1k J, Krause A (2015) Lazier than lazy greedy. In: Proceedings of the 29th AAAI conference on artificial intelligence, pp 1812\u20131818","DOI":"10.1609\/aaai.v29i1.9486"},{"issue":"1","key":"1158_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-I. Math Prog 14(1):265\u2013294","journal-title":"Math Prog"},{"key":"1158_CR21","unstructured":"Perez-Salazar S, Cummings R (2021) Differentially private online submodular maximization. In: Proceedings of the 24th international conference on artificial intelligence and statistics, pp 1279\u20131287"},{"key":"1158_CR22","unstructured":"Qian C, Yu Y, Zhou ZH (2015) Subset selection by pareto optimization. In: Proceedings of the 28th annual conference on neural information processing systems, pp 1765\u20131773"},{"key":"1158_CR23","doi-asserted-by":"crossref","unstructured":"Qian C, Zhang Y, Tang K, Yao X (2018) On multiset selection with size constraints. In: Proceedings of the 32nd AAAI conference on artificial intelligence, pp 1395\u20131402","DOI":"10.1609\/aaai.v32i1.11524"},{"key":"1158_CR24","unstructured":"Rafiey A, Yoshida Y (2020) 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"},{"key":"1158_CR25","unstructured":"Sahin A, Buhmann J M, Krause A (2020) Constrained maximization of lattice submodular functions. In: Proceedings of ICML 2020 workshop on negative dependence and submodularity for ML, No. 119"},{"key":"1158_CR26","unstructured":"Sahin A, Bian Y, Buhmann J M, Krause A (2020) From sets to multisets: provable variational inference for probabilistic integer submodular models. In: Proceedings of the 37th international conference on machine learning, pp 8388\u20138397"},{"key":"1158_CR27","unstructured":"Sadeghi O, Fazel M (2021) Differentially private monotone submodular maximization under matroid and knapsack constraints. In: Proceedings of the 24th international conference on artificial intelligence and statistics, pp 2908\u20132916"},{"key":"1158_CR28","unstructured":"Schiabel A, Kungurtsev V, Marecek J (2021) Randomized algorithms for monotone submodular function maximization on the integer lattice. ArXiv preprint arXiv:2111.10175"},{"key":"1158_CR29","unstructured":"Soma T, Kakimura N, Inaba K, Kawarabayashi K (2014) Optimal budget allocation: theoretical guarantee and efficient algorithm. In: Proceedings of the 31st international conference on machine learning, pp 351\u2013359"},{"key":"1158_CR30","unstructured":"Soma T, Yoshida Y (2015) A generalization of submodular cover via the diminishing return property on the integer lattice. In: Proceedings of the 28th annual conference on neural information processing systems, pp 847\u2013855"},{"key":"1158_CR31","doi-asserted-by":"crossref","unstructured":"Soma T, Yoshida Y (2017) Non-monotone DR-submodular function maximization. In: Proceedings of the 31st AAAI conference on artificial intelligence, pp 898\u2013904","DOI":"10.1609\/aaai.v31i1.10653"},{"issue":"1\u20132","key":"1158_CR32","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s10107-018-1324-y","volume":"172","author":"T Soma","year":"2018","unstructured":"Soma T, Yoshida Y (2018) Maximizing monotone submodular functions over the integer lattice. Math Prog 172(1\u20132):539\u2013563","journal-title":"Math Prog"},{"key":"1158_CR33","doi-asserted-by":"crossref","unstructured":"Syropoulos A (2000) Mathematics of multisets. In: Proceedings of the workshop on multiset processing: multiset processing, mathematical, computer science, and molecular computing points of view, pp 347\u2013358","DOI":"10.1007\/3-540-45523-X_17"},{"key":"1158_CR34","doi-asserted-by":"crossref","unstructured":"Tan J, Xu Y, Zhang D, Zhang X (2021) Maximizing the sum of a supermodular function and a monotone DR-submodular function subject to a knapsack constraint on the integer lattice. In: Proceedings of the 10th international conference on computational data and social networks, pp 68\u201375","DOI":"10.1007\/978-3-030-91434-9_7"},{"issue":"3","key":"1158_CR35","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-021-01014-1","volume":"80","author":"Z Zhang","year":"2021","unstructured":"Zhang Z, Du D, Jiang Y, Wu C (2021) Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint. J Global Optim 80(3):595\u2013616","journal-title":"J Global Optim"},{"key":"1158_CR36","doi-asserted-by":"crossref","unstructured":"Zhang Z, Guo L, Wang L, Zou J (2020) A streaming model for monotone lattice submodular maximization with a cardinality constraint. In: Proceedings of the 21st international conference on parallel and disteibuted computing, applications and technlolgies, pp 362\u2013370","DOI":"10.1007\/978-3-030-69244-5_32"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01158-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01158-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01158-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T13:10:26Z","timestamp":1715951426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01158-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,19]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1158"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01158-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,19]]},"assertion":[{"value":"18 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"58"}}