Deterministic algorithms for rank aggregation and other ranking and clustering problems

  • Authors:

  • Anke Van Zuylen;David P. Williamson

  • Affiliations:

  • School of Operations Research and Information Engineering, Cornell University, Ithaca, NY;School of Operations Research and Information Engineering, Cornell University, Ithaca, NY

  • Venue:
  • WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximation algorithms for these problems. Together with Hegde and Jain, we recently proposed deterministic versions of some of these randomized algorithms [2]. With one exception, these algorithms required the solution of a linear programming relaxation. In this paper, we introduce a purely combinatorial deterministic pivoting algorithm for weighted ranking problems with weights that satisfy the triangle inequality; our analysis is quite simple. We then shown how to use this algorithm to get the first deterministic combinatorial approximation algorithm for the partial rank aggregation problem with performance guarantee better than 2. In addition, we extend our approach to the linear programming based algorithms in Ailon et al. [1] and Ailon [3]. Finally, we show that constrained rank aggregation is not harder than unconstrained rank aggregation.