Proves upper and lower bounds on the gap between minimum sum set cover cost and standard set cover size for hypergraphs and graphs, plus an FPT algorithm for bounded-rank hypergraphs parameterized by the sum cost.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Minimum Sum Set Cover: Structures and Algorithm
Proves upper and lower bounds on the gap between minimum sum set cover cost and standard set cover size for hypergraphs and graphs, plus an FPT algorithm for bounded-rank hypergraphs parameterized by the sum cost.