Minimum-weight vertex cover problem for two-class resource connection graphs

We study the minimum-weight vertex cover problem for a special type of three-partite graphs called two-class resource connection graphs. This problem is important due to its various application in different problem domains, especially in broadcast distributed computing systems. A mapping between this problem and some practical problems is developed and it is shown that these problems are equivalent. We prove the minimum-weight vertex cover problem for two-class resource connection graphs is NP-hard. Some properties of such graphs are identified and an efficient heuristic based on the identified properties is given. Two interesting special cases of this problem are also discussed. © 1993.link_to_subscribed_fulltex