A primal-dual approximation algorithm for generalized Steiner network problems.
David P. WilliamsonMichel X. GoemansMilena MihailVijay V. VaziraniPublished in: STOC (1993)
Keyphrases
- primal dual
- linear programming problems
- convergence rate
- linear programming
- simplex method
- interior point algorithm
- convex functions
- approximation algorithms
- iterative algorithms
- optimization problems
- dynamic programming
- simplex algorithm
- interior point methods
- convex programming
- objective function
- semidefinite programming
- variational inequalities
- nonnegative matrix factorization
- linear systems
- randomly generated
- convex hull
- combinatorial optimization
- np hard
- high resolution
- computational complexity
- optimal solution
- approximation guarantees
- learning algorithm
- affine scaling