A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems.
David P. WilliamsonMichel X. GoemansMilena MihailVijay V. VaziraniPublished in: Comb. (1995)
Keyphrases
- primal dual
- linear programming
- semidefinite programming
- convergence rate
- dynamic programming
- linear programming problems
- learning algorithm
- approximation algorithms
- np hard
- worst case
- approximation ratio
- convex optimization
- objective function
- algorithm for linear programming
- simplex algorithm
- computational complexity
- optimal solution
- combinatorial optimization
- convex functions
- iterative algorithms
- affine scaling
- knapsack problem
- convex hull
- variational inequalities
- interior point methods
- simplex method
- linear program
- np complete
- convex programming
- dual formulation
- convex constraints