4 citations · 22 across the 15 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.OC2016
Improvable Knapsack Problems
Marc Goerigk, Yogish Sabharwal, Anita Schöbel +1
We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Whic…
cs.CG2016★ 2 cited
Faster Coreset Construction for Projective Clustering via Low-Rank Approximation
Rameshwar Pratap, Sandeep Sen
In this work, we present a randomized coreset construction for projective clustering, which involves computing a set of closest -dimensional linear (affine) subspaces of a g…