Pretty much.

I start by saying we need N relays per person (e.g. N=2 for me, I don't like lots of traffic, but it used to default to 3).

Then I iterate through each relay and count how many people it covers, and take the relay that covers the most people, decrementing by 1 the number of relays those people each still need (and remembering the assignment so we ask the relays only about the people we assigned to it). Then I do it again until some condition halts the process (ran out of relays, or made no further progress).

If a relay connection fails or drops then I go back and pick more relays again to cover the people now needing 1 more. That might mean several new relays are required to replace.

I expect that with negentropy I will change this algorithm to connect to all of a person's relays which support negentropy, but only up to N=2 of ones that don't.