In many applications, the data is of rich structure that can be represented by a hypergraph, where the data items are represented by vertices and the associations among items are represented by hyperedges. Equivalently, we are given an input bipartite graph with two types of vertices: items, and associations (which we refer to as topics). We consider the problem of partitioning the set of items...

In the submodular ranking (SR) problem, input consists of a set functions defined on ground elements. The goal is to order elements for all have value above certain threshold as soon average possible, assuming we choose one element per time. problem flexible enough capture various applications in machine learning, including decision trees. This paper considers min-max version SR where multiple ...