Showing 1 - 10 of 87
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>
Persistent link: https://www.econbiz.de/10010999952
Persistent link: https://www.econbiz.de/10011344374
Persistent link: https://www.econbiz.de/10010382878
Persistent link: https://www.econbiz.de/10010396180
Persistent link: https://www.econbiz.de/10010402943
Persistent link: https://www.econbiz.de/10011292584
Persistent link: https://www.econbiz.de/10011724360
Persistent link: https://www.econbiz.de/10011654638
Persistent link: https://www.econbiz.de/10011991338
Persistent link: https://www.econbiz.de/10011882730