A primal-dual approximation algorithm for the survivable network design problem in hypergraphs.
Liang ZhaoHiroshi NagamochiToshihide IbarakiPublished in: Discret. Appl. Math. (2003)
Keyphrases
- primal dual
- network design problem
- approximation algorithms
- np hard
- computational complexity
- linear programming
- dynamic programming
- convergence rate
- learning algorithm
- optimal solution
- expectation maximization
- linear program
- convex hull
- worst case
- convex optimization
- integrality gap
- interior point algorithm
- duality gap
- simplex algorithm
- algorithm for linear programming
- minimal cost
- semidefinite programming
- simulated annealing
- objective function
- image processing