Approximation algorithms for clique transversals on some graph classes.
Min Chih LinSaveliy VasilievPublished in: Inf. Process. Lett. (2015)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- constant factor
- worst case
- maximum weight
- minimum cost
- disjoint paths
- vertex cover
- special case
- facility location problem
- network design problem
- open shop
- graph properties
- graph structure
- maximum clique
- np hardness
- primal dual
- spanning tree
- random walk
- bipartite graph
- quasi cliques
- randomized algorithms
- graph mining
- weighted graph
- set cover
- approximation ratio
- graph theory
- emerging patterns
- precedence constraints
- constant factor approximation
- scheduling problem
- constraint satisfaction problems
- linear program
- connected components
- approximation schemes
- polynomial time approximation
- directed graph
- directed acyclic graph