A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique.
Evandro C. BrachtLuis A. A. MeiraFlávio Keidi MiyazawaPublished in: ACM J. Exp. Algorithmics (2005)
Keyphrases
- primal dual
- linear programming
- affine scaling
- linear program
- convex optimization
- interior point methods
- linear programming problems
- approximation algorithms
- convergence rate
- greedy approximation algorithm
- np hard
- interior point algorithm
- semidefinite programming
- algorithm for linear programming
- simplex algorithm
- variational inequalities
- interior point
- active learning
- duality gap
- simplex method
- distance metric
- convex programming
- convex optimization problems
- dual formulation
- reinforcement learning
- multiresolution
- web pages
- saddle point
- optimal solution
- website