The Multi-Commodity Source Location Problems and the Price of Greed
Given a graph G = (V;E), we say that a vertex subset S V covers a vertex v2 V if the edge-connectivity between S and v is at least a given integer k, and also say that S covers an edge vw2 E if v and w are both covered. We propose the multi-commodity source location problem, which is such that given a vertex- and edge-weighted graph G, p players each select q vertices, and obtain a prot that is the total over all players of the weight of each player's covered vertices and edges. However, vertices selected by one player cannot be selected by the other players. The goal is to maximize the total prots of all players. We show that the price of greed, which indicates the ratio of the total prot of cooperating players to that of selsh players based on an ordered strategy, is tightly bounded by minfp;qg. Also when k = 2, we obtain tight bounds for vertex-unweighted trees when sources are located on the leaves.