Tag
This paper studies the maximum strong independent set problem in hypergraphs, developing reductions, bounds, and a greedy algorithm with applications to deduplication tasks.
The study analyzes the performance and algorithmic design of methods created by LLM agents compared to human-designed methods, finding that agents can occasionally match or surpass human state-of-the-art but largely recombine existing algorithmic choices.