A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs

Let G = (V, E) be a graph with a positive number wt(v) assigned to each v ? v. A weighted clique cover of the vertices of G is a collection of cliques with a non-negative weight y_c assigned to each clique C in the collection such that σ_C:v?CY_C?wt(v) for all v ? V. The problem considered is to minimize σ_Cy_C over all weighted clique covers. A polynomial time algorithm for this problem is presented for graphs that are claw-free and perfect.