A randomized approximation algorithm for computing bucket orders

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

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 109; no. 7; pp. 356 - 359
Main Authors:	Ukkonen, Antti, Puolamäki, Kai, Gionis, Aristides, Mannila, Heikki
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.03.2009 Elsevier Elsevier Sequoia S.A
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Approximation Approximation algorithms Combinatorics. Ordered structures Computer science; control theory; systems Exact sciences and technology Graph theory Mathematics Miscellaneous Order, lattices, ordered algebraic structures Randomized algorithms Ranking Sciences and techniques of general use Studies Theoretical computing Approximation algorithms Randomized algorithms Ranking Approximation Computer theory Fitting Ordered set Approximation algorithm Computing Preference Approximation order Information processing Algorithm analysis
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!