Taylor and Francis | OA | 20jan 2026 |

Problem Statement: Problem Setting (Minimum Cost Set Cover) The Scenario: A teacher has n problem ideas and m tags. Each problem i has a preparation cost cost[i]. Each problem i covers a subset of the m tags, represented by a 2D array tags[i][j]. The Goal: Select a subset of problems such that all m tags are covered at the minimum total cost.