Differentially private submodular maximization with a cardinality constraint over the integer lattice

DOI10.1007/S10878-024-01158-2MaRDI QIDQ6495887zbMATH OpenFDO

Authors Jiaming Hu, Dachuan Xu, Donglei Du, Cuixia Miao

Publication date 2 May 2024

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-024-01158-2

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Measured continuous greedy with differential privacy
• Private non-monotone submodular maximization
• Submodular maximization over data streams with differential privacy noise

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• Differentially private combinatorial optimization
• Fast algorithms for maximizing submodular functions
• scientific article; zbMATH DE number 30931 (Why is no real title available?)
• scientific article; zbMATH DE number 2080949 (Why is no real title available?)
• Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint
• Submodular maximization with cardinality constraints
• Theory of Cryptography

Cited in

(2)

• Streaming algorithms for non-monotone DR-submodular maximization under a knapsack constraint on the integer lattice
• Dynamic algorithms for maximizing a DR-submodular function subtracted by a linear function over the integer lattice

This page was built for publication: Differentially private submodular maximization with a cardinality constraint over the integer lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6495887)