Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization

Ankur Nath, Alan Kuhnle

Modern instances of combinatorial optimization problems often exhibit billion-scale ground sets, which have many uninformative or redundant elements. In this work, we develop light…