A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs.
Stephan BeyerMarkus ChimaniJoachim SpoerhasePublished in: COCOON (2020)
Keyphrases
- primal dual
- linear programming
- optimal solution
- computational complexity
- convergence rate
- dynamic programming
- approximation algorithms
- np hard
- simplex algorithm
- linear programming problems
- convex optimization
- infeasible interior point
- algorithm for linear programming
- dual formulation
- interior point methods
- semidefinite programming
- learning algorithm
- weighted graph
- interior point
- knapsack problem
- worst case
- multi objective
- objective function