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...

Given a graph G=(V, E), a set of vertices <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${S \subseteq V}$$</EquationSource> </InlineEquation> covers a vertex <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${v \in V}$$</EquationSource> </InlineEquation> 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,...</equationsource></inlineequation></equationsource></inlineequation>