33 citations · 53 across the 12 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010
Lower Bounds for the Smoothed Number of Pareto optimal Solutions
Tobias Brunsch, Heiko Roeglin
In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number of va…
cs.DS2010★ 15 cited
Efficient Clustering with Limited Distance Information
Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model w…