It's greedy, requiring airplanes and boats as well as new hotels.
Budget is 1/2 of what modified greedy requires to cause a full cascade in (G') across (p_{text {neg}}).
For example, contrasting the top and bottom panels of Fig. 17: to infect roughly 15 additional nodes, modified greedy requires 100 additional seeds!
Caution is warranted in making direct comparisons between Fig. 10 ((text{OAS}_{text {mg}})) and Fig. 11 ((text {OAS}_{text {tg}})): modified greedy requires a higher budget to cause a full cascade in (G) for most thresholds: 0.2, 0.6, 0.8.
For each synthetic network (small-world, scale-free), we considered seeding at various fractions of the budget greedy seeding required to obtain a complete cascade in (G).
However, this particular greedy algorithm requires detailed knowledge about network topology, and knowledge about expected client locations on the topology.
This algorithm runs in O(n) time, improving the time of the algorithm based on the greedy technique, requiring O(m) time, that may be near to Θ(n2) for unigraphs.
Both heuristics are greedy and require low computational complexity.
Finally, the greedy method requires designing 1 2 μ ( 2 L c - μ + 1 ) filters.
The modified greedy strategy requires a large number of seeds (163) to cause a full cascade in (G).
