Abstract: We consider the classical metric k-median clustering problem over a set of input rankings (i.e., permutations), which has myriad applications, from social-choice theory to web search and databases. A folklore algorithm provides a 2-approximate solution in polynomial time for k=O(1) and works irrespective of the…

Abstract: Modern software critically relies on reusable, open source software packages, especially for JavaScript. They enable fast development of advanced applications, but also introduce major challenges with incompatibilities, security vulnerabilities, and breaking changes. In this talk, I will describe ongoing work on…