Some approximation algorithms for the clique partition problem in weighted interval graphs.
Mingxia ChenJianbo LiJianping LiWeidong LiLusheng WangPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- approximation algorithms
- undirected graph
- maximum weight
- maximum clique
- np hard
- association graph
- vertex cover
- weighted graph
- special case
- independent set
- worst case
- graph properties
- graph model
- minimum cost
- approximation ratio
- bipartite graph
- primal dual
- open shop
- facility location problem
- set cover
- graph matching
- network design problem
- approximation guarantees
- disjoint paths
- constant factor
- randomized algorithms
- approximation schemes
- quasi cliques
- precedence constraints
- minimum weight
- graph partitioning
- combinatorial auctions
- np hardness
- min cut
- spanning tree
- branch and bound algorithm
- edge weights
- weighted sum
- directed graph