Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

41

WAOA
2010
Springer

favoriteEmaildiscussreport

275views Algorithms» more WAOA 2010»

Online Ranking for Tournament Graphs

13 years 2 months ago

Online Ranking for Tournament Graphs

Download www.cs.brown.edu

We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximization and the minimization versions of the problem on tournaments (max acyclic subgraph, feedback arc set). We also study the case when the items arrive in random order.

Claire Mathieu, Adrian Vladu

Real-time Traffic

Algorithms | Global Ranking | Max Acyclic Subgraph | Pairwise Ranking | WAOA 2010 |

claim paper

Related Content

» How to rank with few errors

» Learning to rank graphs for online similar graph search

» Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments

» Simultaneous approximations for adversarial and stochastic online budgeted allocation

» Hardness of fully dense problems

» Measuring credibility of users in an elearning environment

» RankCompete simultaneous ranking and clustering of web photos

» Local methods for estimating pagerank values

» Objectlevel ranking bringing order to Web objects

Post Info
More Details (n/a)

Added	15 Feb 2011
Updated	15 Feb 2011
Type	Journal
Year	2010
Where	WAOA
Authors	Claire Mathieu, Adrian Vladu

Comments (0)