Keyphrases
- approximation algorithms
- undirected graph
- np hard
- disjoint paths
- constant factor
- special case
- vertex cover
- minimum cost
- worst case
- facility location problem
- graph structure
- directed graph
- approximation ratio
- graph model
- weighted graph
- primal dual
- open shop
- network design problem
- connected components
- random walk
- np hardness
- approximation schemes
- branch and bound algorithm
- precedence constraints
- spanning tree
- max flow
- randomized algorithms
- polynomial time approximation
- constant factor approximation