An updated survey on the linear ordering problem for weighted or unweighted tournaments

I Charon, O Hudry - Annals of Operations Research, 2010 - Springer
In this paper, we survey some results, conjectures and open problems dealing with the
combinatorial and algorithmic aspects of the linear ordering problem. This problem consists …

A survey on the linear ordering problem for weighted or unweighted tournaments

I Charon, O Hudry - 4or, 2007 - Springer
In this paper, we survey some results, conjectures and open problems dealing with the
combinatorial and algorithmic aspects of the linear ordering problem. This problem consists …

Ordres médians et ordres de Slater des tournois

I Charon, O Hudry, F Woirgard - Mathématiques informatique et …, 1996 - numdam.org
Dans cet article, nous essayons de faire le point sur les résultats concernant les aspects
combinatoires et algorithmiques des ordres médians et des ordres de Slater des tournois …

Rank aggregation for meta-search engines

KW Lam, CH Leung - Proceedings of the 13th international World Wide …, 2004 - dl.acm.org
In this paper, we present an algorithm for merging results from different data sources in meta-
search engine. We further extend one that has developed for ranking players of a round …

Médianes métriques et latticielles

O Hudry, B Leclerc, B Monjardet… - Cahiers de la Maison …, 2004 - shs.hal.science
Dans ce texte, nous présentons les notions de médianes utiles pour l'agrégation des
préférences et plus généralement pour les problèmes de consensus. Après une introduction …

An improved MST algorithm for ranking players of a round-robin tournament

A Datta, M Hossain, M Kaykobad - International Journal of …, 2008 - Taylor & Francis
The problem of ranking players in a round-robin tournament, in which the outcome of any
match is a win or a loss, is to rank them according to their performances in the tournament. In …

[PDF][PDF] Realizing interoperability of e-learning repositories

D Olmedilla - 2007 - Citeseer
Nowadays, the digital world has become a reality and, as a consequence, the amount of
information available is difficult to manage and is increasing rapidly. In such a world …

Metric and latticial medians

B Monjardet, JP Barthélemy, O Hudry… - … Process: Concepts and …, 2009 - shs.hal.science
This paper presents the-linked-notions of metric and latticial medians and it explains what is
the median procedure for the consensus problems, in particular in the case of the …

Majority Spanning Trees, Cotrees and Their Applications

M Kaykobad, FJM Salzborn - … , Yangon, Myanmar, February 28–March 2 …, 2021 - Springer
We show that in any digraph on an underlying connected graph with non-negative weights
on its edges, there is a Majority Spanning Tree for which sum of weights of edges of a …

[PDF][PDF] A New Ranking Algorithm for a Round-Robin Tournament

R Rowaida, AA Munia - 2017 - researchgate.net
Ahsanullah University of Science & Technology Abstract-The problem of ranking players in a
round-robin tournament, in which outcome of any match is a win or a loss, is to rank players …