On maximization of weakly modular functions: Guarantees of multi-stage algorithms, tractability, and hardnessAug 26, 2020·Shinsaku Sakaue· 0 min read PDFTypeConference paperPublicationInternational Conference on Artificial Intelligence and Statistics (AISTATS)Last updated on Aug 26, 2020 ← Guarantees of stochastic greedy algorithms for non-monotone submodular maximization with cardinality constraints Aug 26, 2020Practical Frank–Wolfe method with decision diagrams for computing Wardrop equilibrium of combinatorial congestion games Apr 1, 2020 →