Table 1.
Metapopulation model notation.
Fig 1.
The instance of MaxCasesAverted and MaxPeaksReduced is a graph G constructed from the given instance of Max k-SI.
Each node represents a subpopulation, with the size of the subpopulation shown in square brackets next to it. The directed edges permit 1 unit flow. The unit flows from nodes Pj to pi encode non-membership. For example, the flow from P1 to p2 implies that .
Table 2.
Summary of greedy algorithms presented in this section. Details of approximation factors for FastGreedy and UnitGreedy may be found in [26] and [25], respectively.
Fig 2.
Percentage totBurden and percentage maxBurden reduced by all approaches for = 0.5345 in New Hampshire for FRED (first column) and SafeGraph (second column).
Fig 3.
Percentage totBurden and percentage maxBurden reduced by UnitGreedy, SingletonGreedy, FastGreedy and baselines for = 0.535 in Iowa for FRED (first column) and SafeGraph (second column).
Fig 4.
Percentage totBurden and percentage maxBurden reduced by UnitGreedy, FastGreedy and baselines for = 0.525 in Texas for FRED (first column) and SafeGraph (second column).
Table 3.
Approximation factors for each problem instance.
Table 4.
Estimates of for each problem instance.
Table 5.
FastGreedy, UnitGreedy, SingletonGreedy, 3-EnumGreedy, and POMS comparison with respect to practical running time (estimated for POMS) to achieve approximation guarantee for New Hampshire with and
budgets.