A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs.
Stephan BeyerMarkus ChimaniJoachim SpoerhasePublished in: CoRR (2018)
Keyphrases
- primal dual
- linear programming
- linear programming problems
- approximation algorithms
- learning algorithm
- optimal solution
- approximation ratio
- convergence rate
- semidefinite programming
- np hard
- simplex method
- infeasible interior point
- interior point algorithm
- simplex algorithm
- interior point methods
- randomly generated
- convex optimization
- dynamic programming
- computational complexity
- variational inequalities
- iterative algorithms
- linear program
- worst case
- pairwise
- approximation guarantees
- saddle point
- duality gap
- objective function