Differentially private combinatorial optimization
From MaRDI portal
Recommendations
Cited in
(34)- A fast algorithm for submodular maximization with a matroid constraint
- On reconstructability of quadratic utility functions from the iterations in gradient methods
- Selling privacy at auction
- A differentially private approximation algorithm for submodular maximization under a polymatroid constraint over the integer lattice
- Differentially private k-center problems
- Private approximation of search problems
- The complexity of computing the optimal composition of differential privacy
- Private Approximation of Clustering and Vertex Cover
- Private Approximation of Search Problems
- A survey on approximation mechanism design without money for facility games
- Foundations of Differentially Oblivious Algorithms
- Average Sensitivity of Graph Algorithms
- Improved lower bound for differentially private facility location
- Greedy algorithms for stochastic monotone k-submodular maximization under full-bandit feedback
- Analysis of centrality measures under differential privacy models
- Jointly private convex programming
- Approximation algorithms for min-max generalization problems
- Differentially private learning of geometric concepts
- Streaming submodular maximization under differential privacy noise
- Measured continuous greedy with differential privacy
- Near optimal jointly private packing algorithms via dual multiplicative weight update
- Combinatorial resources auction in decentralized edge-thing systems using blockchain and differential privacy
- Submodular maximization over data streams with differential privacy noise
- Private matchings and allocations
- The complexity of computing the optimal composition of differential privacy
- Differentially-private learning of low dimensional manifolds
- Differentially private submodular maximization with a cardinality constraint over the integer lattice
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- Privacy preserving clustering with constraints
- Optimal lower bounds for universal and differentially private Steiner trees and TSPs
- Approximation algorithms for facility location and k-median with differential privacy
- Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems
- Private non-monotone submodular maximization
- Private coresets
This page was built for publication: Differentially private combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417694)
