Search Results for author:
Found 2 papers, 1 papers with code
Multi-Swap $k$-Means++
The $k$-means++ algorithm of Arthur and Vassilvitskii (SODA 2007) is often the practitioners' choice algorithm for optimizing the popular $k$-means clustering objective and is known to give an $O(\log k)$-approximation in expectation.
An Optimal Algorithm for Finding Champions in Tournament Graphs
In this paper, we address the problem of finding a champion of the tournament, also known as Copeland winner, which is a player that wins the highest number of matches.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
