The Computational Complexity of and Approximation Algorithms for Variants of the Component Selection Problem.
Mostafa Nouri BaygiPublished in: Int. J. Found. Comput. Sci. (2018)
Keyphrases
- approximation algorithms
- np hard
- computational complexity
- special case
- worst case
- facility location problem
- np complete
- vertex cover
- minimum cost
- network design problem
- open shop
- linear programming
- exact algorithms
- primal dual
- scheduling problem
- approximation schemes
- approximation ratio
- set cover
- constant factor
- np hardness
- disjoint paths
- undirected graph
- precedence constraints
- genetic algorithm
- polynomial time approximation
- greedy algorithm
- mathematical model
- lower bound
- objective function