Tag
This paper studies the maximum strong independent set problem in hypergraphs, developing reductions, bounds, and a greedy algorithm with applications to deduplication tasks.