Maximum-cover source location problems with objective edge-connectivity three

Maximum-cover source location problems with objective edge-connectivity three

0.00 Avg rating0 Votes
Article ID: iaor200971594
Country: Germany
Volume: 70
Issue: 1
Start Page Number: 183
End Page Number: 193
Publication Date: Aug 2009
Journal: Mathematical Methods of Operations Research
Authors: ,
Keywords: graphs
Abstract:

Given a graph G = (V, E), a set of vertices SV covers a vertex vV if the edge-connectivity between S and v is at least a given number k. Vertices in S are called sources. The maximum-cover source location problem, which is a variation of the source location problem, is to find a source set S with a given size at most p, maximizing the sum of the weight of vertices covered by S. In this paper, we show a polynomial-time algorithm for this problem in the case of k = 3 for a given undirected graph with a vertex weight function and an edge capacity function. Moreover, we show that this problem is NP-hard even if vertex weights and edge capacities are both uniform for general k.

Reviews

Required fields are marked *. Your email address will not be published.