Given a graph G=(V, E), a set of vertices $${S \subseteq V}$$ covers a vertex $${v \in V}$$ 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...