Measured continuous greedy with differential privacy

DOI10.1007/978-3-030-93176-6_19zbMath1498.90203OpenAlexW4205436230MaRDI QIDQ2151374

Yanyan Li

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_19

zbMATH Keywords

approximation algorithmdifferential privacysubmodular maximizationdown-monotone family

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Privacy of data (68P27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on maximizing a submodular set function subject to a knapsack constraint
• Symmetry and Approximability of Submodular Maximization Problems
• On Multiplicative Weight Updates for Concave and Submodular Function Maximization
• Maximizing Non-monotone Submodular Functions
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Constrained Submodular Maximization via a Nonsymmetric Technique
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• Non-monotone submodular maximization under matroid and knapsack constraints
• Cheeger Inequalities for Submodular Transformations
• Submodular Maximization with Cardinality Constraints
• An efficient algorithm for image segmentation, Markov random fields and related problems
• A Unified Continuous Greedy Algorithm for Submodular Maximization

This page was built for publication: Measured continuous greedy with differential privacy