How well can primal-dual and local-ratio algorithms perform?
Allan BorodinDavid CashmanAvner MagenPublished in: ACM Trans. Algorithms (2011)
Keyphrases
- primal dual
- simplex algorithm
- linear programming
- interior point
- convex optimization
- learning algorithm
- computational complexity
- optimization problems
- affine scaling
- convex optimization problems
- linear programming problems
- interior point methods
- convergence rate
- computationally intensive
- approximation algorithms
- combinatorial optimization
- linear program
- object recognition
- computer vision