a polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs：无爪完美图最小加权团覆盖问题的多项式算法.pdfVIP

Discrete Mathematics 3X ( 19X2) 6S-71 65 North-Holland Publishing Company Let G = (V, E) be a graph with a positive number wt(v) assigned to each L’E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection such that xc. c6c, y,. 3 tit(tl) for all v E V. The problem considered is to mini nizc xc yc- over all weighted cue covers. A polynomial time algorithm for this problem is presented for graphs thpt are craw-free and perfect. 1. oduction Let G = ( I/. E) be a tinitc, undirected, loopless graph without multiple edges. A Uertex packing in G is a _set P c V such that u,, 2-:,E P implies (vi*2,) $ E: a clique in G is a subset CC_ V such that Ui,U,E C implies (u,. t‘,) E E. Let wt( u) be a non-negative number assigned to each vertex u E V and for P c V define wt( P) to be the sum of the individual vertex weights of f. The wei,olzfeti vertex pclcking prern is to find a packing of maximum weight in G. A weiglzted clique c*ouer of the vertices cf G is a collection % of cliques with a non-negative weight yc assigned to each C’E % such that The weighted cii+ e cover prnhlerr: is t#. find a weighted clique cover that minimizes )lC.(6 yC,. le case of wt( U) = 1 for all c E V is referred to as the “unweighted” pro bipartite g