Private non-monotone submodular maximization

DOI10.1007/S10878-022-00875-WzbMath1505.90112OpenAlexW4283327076MaRDI QIDQ2091093

Yanyan Li

Publication date: 31 October 2022

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

Full work available at URL: https://doi.org/10.1007/s10878-022-00875-w

zbMATH Keywords

approximation algorithmdifferential privacysubmodular maximizationdown-closed family of setsmeasured continuous greedy

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An 0. 828-approximation algorithm for the uncapacitated facility location problem
• On Multiplicative Weight Updates for Concave and Submodular Function Maximization
• Maximizing Non-monotone Submodular Functions
• A threshold of ln n for approximating set cover
• 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
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Better Balance by Being Biased
• Non-monotone submodular maximization under matroid and knapsack constraints
• Cheeger Inequalities for Submodular Transformations
• Submodular Maximization with Cardinality Constraints
• Learning with Submodular Functions: A Convex Optimization Perspective
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• A Unified Continuous Greedy Algorithm for Submodular Maximization

This page was built for publication: Private non-monotone submodular maximization