22 citations · 50 across the 9 of their papers we have counts for
4 papers · 1 filter
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
Marek Karpinski, Warren Schudy
We study fixed parameter algorithms for three problems: Kemeny rank aggregation, feedback arc set tournament, and betweenness tournament. For Kemeny rank aggregation we give an alg…
Online Correlation Clustering
Claire Mathieu, Ocan Sankur, Warren Schudy
We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v,…
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems
Marek Karpinski, Warren Schudy
We design the first polynomial time approximation schemes (PTASs) for the Minimum Betweenness problem in tournaments and some related higher arity ranking problems. This settles th…
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems
Marek Karpinski, Warren Schudy
We design a linear time approximation scheme for the Gale-Berlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C…