Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs.
Anand BhalgatDeeparnab ChakrabartySanjeev KhannaPublished in: APPROX-RANDOM (2011)
Keyphrases
- steiner tree
- differentially private
- lower bound
- linear programming relaxation
- upper bound
- minimum spanning tree
- shortest path
- worst case
- optimal solution
- branch and bound
- facility location
- traveling salesman problem
- differential privacy
- dynamic programming
- linear programming
- objective function
- particle swarm optimization
- lower and upper bounds
- evolutionary algorithm
- search algorithm