Seeding with Costly Network Information: PROBE and SEED Find a Seed Set Covering (1 − 1/e)OPT − ε′n Nodes in Expectation with an Explicitly Bounded Expected Number of Edge QueriesResearch Paper
Choosing a small group of people to start an intervention can have a much larger effect when their contacts pass it on. In many applications the contacts themselves are expensive to learn: a survey worker can ask about a person's neighbors, or a crawler can request one adjacency-list entry, but neither necessarily has a complete network. Eckles, Esfandiari,…