The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders

DOI10.1007/s10878-012-9467-xzbMath1298.90082OpenAlexW2083762248WikidataQ61687294 ScholiaQ61687294MaRDI QIDQ2392744

Franz-Josef Brandenburg, Andreas Hofmeier, Andreas Gleißner

Publication date: 2 August 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9467-x

zbMATH Keywords

rankingpartial ordersfixed-parameter tractabilityrank aggregationSpearman footrule distance

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (3)

Ranking chain sum orders ⋮ Beyond rankings: comparing directed acyclic graphs ⋮ On the hardness of maximum rank aggregation problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kernels for feedback arc set in tournaments
• On the complexity of crossings in permutations
• Metric methods for analyzing partially ranked data
• Voting schemes for which it can be difficult to tell who won the election
• Towards a dichotomy for the possible winner problem in elections based on scoring rules
• Fixed-parameter tractability results for feedback set problems in tournaments
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Comparing and Aggregating Partial Orders with Kendall Tau Distances
• The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders
• Exact analysis of Dodgson elections
• Comparing Top k Lists
• Comparing Partial Rankings

This page was built for publication: The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders