Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees.
Naveen GargVijay V. VaziraniMihalis YannakakisPublished in: Algorithmica (1997)
Keyphrases
- approximation algorithms
- primal dual
- rooted trees
- np hard
- affine scaling
- linear programming problems
- interior point algorithm
- interior point methods
- min cost
- special case
- worst case
- semidefinite programming
- minimum cost
- simplex algorithm
- vertex cover
- approximation ratio
- constant factor
- interior point
- set cover
- network design problem
- valid inequalities
- algorithm for linear programming
- convex programming
- np hardness
- scheduling problem
- constant factor approximation
- quadratic program
- approximation guarantees
- randomized algorithms
- tree mining
- convex optimization