leon@es.ele.tue.nl (& Stok) (09/25/90)
Does anyone have any solutions / pointers to algorithms to solve the
following problem ?
Given a transitive (orientable) graph G(V,E). Each vertex has a set Sv
attached to it, which is a subset from the set { 1 .. n }.
The weight of a clique is defined as the cardinality of the set X, which
is the union of all sets Sv of all vertices in this clique.
Question : Find a minimum weight clique covering of G(V,E).
--
-------------------------------------------------------------------------------
Leon Stok | Email: leon@es.ele.tue.nl
Eindhoven University of Technology |
Dept. of Electrical Engineering |
Design Automation Section |
P.O. Box 513 | Phone: ... - 31 - 40 - 473352
NL-5600 MB Eindhoven | Fax: ... - 31 - 40 - 448375
The Netherlands |
-------------------------------------------------------------------------------