42 citations · 204 across the 38 of their papers we have counts for
3 papers · 1 filter
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms
Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson +1
Clustering is a classic topic in optimization with -means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best known algori…
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
Abbas Bazzi, Samuel Fiorini, Sangxia Huang +1
Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of cover…
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios
Christos Kalaitzis, Ola Svensson, Jakub Tarnawski
We consider the classic problem of scheduling jobs on unrelated machines so as to minimize the weighted sum of completion times. Recently, for a small constant , B…