A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.
Liang ZhaoHiroshi NagamochiToshihide IbarakiPublished in: STACS (2001)
Keyphrases
- primal dual
- network design problem
- approximation algorithms
- linear programming
- np hard
- dynamic programming
- interior point algorithm
- semidefinite programming
- convergence rate
- linear program
- expectation maximization
- minimal cost
- interior point methods
- learning algorithm
- simulated annealing
- search space
- worst case
- network design
- pairwise
- computational complexity
- objective function
- image processing