23 citations · 47 across the 13 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 23 cited
Min-Max Graph Partitioning and Small Set Expansion
Nikhil Bansal, Uriel Feige, Robert Krauthgamer +5
We study graph partitioning problems from a min-max perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maxi…
cs.CC2011★ 2 cited
On the Furthest Hyperplane Problem and Maximal Margin Clustering
Zohar Karnin, Edo Liberty, Shachar Lovett +2
This paper introduces the Furthest Hyperplane Problem (FHP), which is an unsupervised counterpart of Support Vector Machines. Given a set of n points in Rd, the objective is to pro…