Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach.
Niv BuchbinderJoseph NaorPublished in: FOCS (2006)
Keyphrases
- primal dual
- linear programming
- duality gap
- linear program
- affine scaling
- interior point methods
- convex optimization
- convergence rate
- approximation algorithms
- interior point algorithm
- simplex algorithm
- algorithm for linear programming
- upper bound
- linear programming problems
- dual formulation
- variational inequalities
- semidefinite programming
- simplex method
- convex programming
- interior point
- special case
- computational complexity
- infeasible interior point
- lower and upper bounds
- convex functions
- learning algorithm
- np hard
- evolutionary algorithm
- lower bound
- optimal solution
- objective function