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.

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 109; číslo 7; s. 356 - 359
Hlavní autoři: Ukkonen, Antti, Puolamäki, Kai, Gionis, Aristides, Mannila, Heikki
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.03.2009
Elsevier
Elsevier Sequoia S.A
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We show that a simple randomized algorithm has an expected constant factor approximation guarantee for fitting bucket orders to a set of pairwise preferences.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2008.12.003