The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders
From MaRDI portal
Publication:3004688
DOI10.1007/978-3-642-21204-8_37zbMath1329.68131OpenAlexW2277381720MaRDI QIDQ3004688
Andreas Hofmeier, Andreas Gleißner, Franz-Josef Brandenburg
Publication date: 3 June 2011
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_37
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
- Exact analysis of Dodgson elections
- Comparing Partial Rankings
This page was built for publication: The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders
