A randomized approximation algorithm for computing bucket orders

Information Processing Letters

Volumn 109, Issue 7, 2009, Pages 356-359

  Ukkonen, Antti ^a,b   Puolamäki, Kai ^a,b   Gionis, Aristides ^d   Mannila, Heikki ^a,b,c  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

^b AALTO UNIVERSITY   (Finland)

^c UNIVERSITY OF HELSINKI   (Finland)

^d YAHOO RESEARCH   (Spain)

Author keywords

Approximation algorithms; Randomized algorithms; Ranking

Indexed keywords

ALGORITHMS;

BUCKET ORDERS; CONSTANT-FACTOR APPROXIMATIONS; RANDOMIZED ALGORITHMS; RANDOMIZED APPROXIMATIONS; RANKING;

APPROXIMATION ALGORITHMS;

EID: 59449106885     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.12.003     Document Type: Article

References (6)

1. N. Ailon, M. Charikar, and A. Newman, Aggregating inconsistent information: ranking and clustering, in: Proceedings of the 37th ACM Symposium on Theory of Computing, 2005, pp. 684-693
2. D. Coppersmith, L. Fleischer, A. Rudra, Ordering by weighted number of wins gives a good ranking for weighted tournaments, in: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006, pp. 776-782
3. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman
4. A. Gionis, H. Mannila, K. Puolamäki, A. Ukkonen, Algorithms for discovering bucket orders from data, in: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006, pp. 561-566
5. C. Kenyon-Mathieu and W. Schudy, How to rank with few errors, in: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, 2007, pp. 95-103
6. A. Ukkonen, Algorithms for finding orders and analyzing sets of chains, PhD thesis, Helsinki University of Technology, 2008