A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs.
Flavia BonomoGianpaolo OrioloClaudia SnelsPublished in: CTW (2011)
Keyphrases
- minimum weight
- maximum cardinality
- linear programming
- objective function
- learning algorithm
- segmentation algorithm
- np hard
- computational complexity
- dynamic programming
- maximum weight
- optimal solution
- minimum spanning tree
- bipartite graph
- graph structure
- spanning tree
- simulated annealing
- weighted graph
- knapsack problem
- randomized algorithm
- ant colony optimization
- planar graphs
- particle swarm optimization
- genetic algorithm