A randomized approximation algorithm for computing bucket orders

DOI10.1016/J.IPL.2008.12.003zbMATH Open1191.68874OpenAlexW2158856152MaRDI QIDQ976119FDOQ976119

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Aggregating inconsistent information
• Ordering by weighted number of wins gives a good ranking for weighted tournaments

Cited In (11)

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

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)