Approximation algorithms for digraph width parameters.
Shiva KintaliNishad KothariAkash KumarPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- primal dual
- np hardness
- network design problem
- exact algorithms
- approximation schemes
- precedence constraints
- constant factor
- constant factor approximation
- disjoint paths
- optimal solution
- approximation ratio
- knapsack problem
- expectation maximization
- parameter estimation
- randomized algorithms
- maximum likelihood
- computational complexity
- search algorithm