Competitive Random-Order Correlation k-Clustering
A surprising lower bound of $\Omega(\log k)$-competitiveness for any online algorithm can be extended to $\Omega(\log n)$ when $k = \text{poly}(n)$.
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
A surprising lower bound of $\Omega(\log k)$-competitiveness for any online algorithm can be extended to $\Omega(\log n)$ when $k = \text{poly}(n)$.
Correlation clustering has been extensively studied over the last two decades in many different computational models owing to its wide-ranging practical applications. The goal is to compute a partition of the vertex set such that the total number of disagreements, i.e. the sum of edges between clusters, and non-edges w...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.