Balanced sets in an independence structure induced by a submodular function
AbstractA submodular (and non-decreasing) function on a set induces an independence structure; the notion of a “balanced” set in this situation helps us determine whether a given independence structure is induced by any submodular function other than its own rank function, answering a question of U. S. R. Murty and I. Simon.
openaire +1 more source
Hypergraphs with edge-dependent vertex weights: p-Laplacians and spectral clustering. [PDF]
Zhu Y, Segarra S.
europepmc +1 more source
On the Initial Set of Constraints for Graph-Based Submodular Function Maximization
A crucial problem in combinatorial optimization is the submodular function maximization (SFM), and in many cases it involves graphs on which the maximization is specified. The problem is well-studied and hence there are several proposed algorithms in the literature.
Eszter Csókás, Tamás Vinkó
openaire +1 more source
Ranking with submodular functions on a budget. [PDF]
Zhang G, Tatti N, Gionis A.
europepmc +1 more source
Regularized impurity reduction: accurate decision trees with complexity guarantees. [PDF]
Zhang G, Gionis A.
europepmc +1 more source
Discovering Key Sub-Trajectories to Explain Traffic Prediction. [PDF]
Wang H, Fan Z, Chen J, Zhang L, Song X.
europepmc +1 more source
Maximizing Submodular Set Functions Subject to Multiple Linear Constraints [PDF]
Ariel Kulik, Hadas Shachnai, Tami Tamir
openaire +1 more source
Semi-streaming algorithms for submodular matroid intersection. [PDF]
Garg P, Jordan L, Svensson O.
europepmc +1 more source
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory. [PDF]
Sason I.
europepmc +1 more source
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms. [PDF]
Yang Y, Chen PA, Lee YC, Fanchiang YY.
europepmc +1 more source

