A randomized approximation algorithm for computing bucket orders

DOI10.1016/J.IPL.2008.12.003MaRDI QIDQ976119zbMATHOpenAlexFDO

Authors Antti Ukkonen, Kai Puolamäki, Aristides Gionis, Heikki Mannila

Publication date 16 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.12.003

zbMATH Keywords

rankingrandomized algorithmsapproximation algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25)

Cites work

• scientific article; zbMATH DE number 5485441 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Aggregating inconsistent information
• Ordering by weighted number of wins gives a good ranking for weighted tournaments

Cited in

(11)

• Complexity reduction and approximation of multidomain systems of partially ordered data
• Using extension sets to aggregate partial rankings in a flexible setting
• Detecting and ordering salient regions
• Approaching the rank aggregation problem by local search-based metaheuristics
• Multi-dimensional Bayesian network classifiers for partial label ranking
• Median constrained bucket order rank aggregation
• A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
• LATIN 2004: Theoretical Informatics
• Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem
• Ensemble learning for the partial label ranking problem
• Upper tail analysis of bucket sort and random tries

This page was built for publication: A randomized approximation algorithm for computing bucket orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976119)