On Maximum Rank Aggregation Problems

DOI10.1007/978-3-642-45278-9_3zbMath1407.68201OpenAlexW2113199316MaRDI QIDQ2870013

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

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45278-9_3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Individual preferences (91B08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On the hardness of maximum rank aggregation problems

This page was built for publication: On Maximum Rank Aggregation Problems