Skip to content
Astera Technology

Find the least-effort set covering all required capabilities

Use set coverage when overlapping features do not earn duplicate coverage.

Plan from the supplied facts

Fictional required capabilities are X,Y,Z. Option A covers X/Y at 4 hours; B covers Y/Z at 3; C covers X at 2. Coverage is a union, not a points sum. The objective is to cover all three with least effort, with no dependencies beyond those shown.

Editable original planning example
SetHoursCovered capabilitiesComplete
A + B7X,Y,ZYes
B + C5X,Y,ZYes
A + C6X,YNo: Z missing
Download editable CSV ↓

Work through the choice

B+C covers all three in five hours. Every single option misses something; A+B costs more, A+C is incomplete and all three cost nine.

Why is the six-hour A+C set not a cheaper complete alternative?

Show the worked answer

It has no Z coverage. Duplicate X coverage does not compensate for missing Z; the complete set with least effort remains B+C at five hours.

Material to use in your plan

Use one column per required capability and mark each option’s coverage. For each subset, union the marked columns and sum effort; compare only complete subsets.

Related resources