Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates
The paper develops an incidence-structural toolkit for this problem, and proves exact reductions for dominance, incidence twins, and weight-1 blocks; derive closed-form and low-weight upper bounds; introduce puncturing and covering certificates that sharpen those bounds; and analyze a layered greedy clustering algorith...
Ying-Quan Wu, Jason Cong
· 0 citations