Nearly Optimal Submodular Sparsification, with and without Cardinality ConstraintsResearch Paper
Many objects in combinatorial optimization are sums of submodular set functions on a common ground set : cut functions of directed hypergraphs, where each is one hyperedge or one server's subgraph, and aggregate welfare functions of agents with submodular valuations over resources. When , storing…