PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

A randomized approximation algorithm for computing bucket orders
Antti Ukkonen, Kai Puolamäki, Aristides Gionis and Heikki Mannila
Information Processing Letters Volume 109, Number 7, pp. 356-359, 2009.

Abstract

We show that a simple randomized algorithm has an expected constant factor approximation guarantee for fitting bucket orders to a set of pairwise preferences.

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:5154
Deposited By:Kai Puolamäki
Deposited On:24 March 2009