2 papers
cs.DS2025
Discretely Beyond : Guided Combinatorial Algorithms for Submodular Maximization
Yixin Chen, Ankur Nath, Chunli Peng +1
For constrained, not necessarily monotone submodular maximization, all known approximation algorithms with ratio greater than require continuous ideas, such as queries to the…
cs.DS2024
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…