34 citations · 60 across the 20 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
Max-sum diversity via convex programming
Alfonso Cevallos, Friedrich Eisenbrand, Rico Zenklusen
Diversity maximization is an important concept in information retrieval, computational geometry and operations research. Usually, it is a variant of the following problem: Given a…
cs.DM2015
Node-balancing by edge-increments
Friedrich Eisenbrand, Shay Moran, Rom Pinchasi +1
Suppose you are given a graph with a weight assignment and that your objective is to modify using legal steps such that all vertices will h…