A greedy algorithm optimally solves closest-ranking under flag matroid prefix constraints (via Bruhat order), and matroid-constrained rank aggregation is NP-hard for any fixed number of voters ≥ 2.
Fellows, Jiong Guo, Rolf Niedermeier, and Frances A
1 Pith paper cite this work, alongside 86 external citations. Polarity classification is still indexing.
1
Pith paper citing it
86
external citations · OpenAlex
fields
cs.DM 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Ranking and Rank Aggregation with Matroid Prefix Constraints
A greedy algorithm optimally solves closest-ranking under flag matroid prefix constraints (via Bruhat order), and matroid-constrained rank aggregation is NP-hard for any fixed number of voters ≥ 2.