Medians of Permutations: Building Constraints
From MaRDI portal
Publication:2795953
DOI10.1007/978-3-319-29221-2_23zbMath1437.05012OpenAlexW2403530833WikidataQ60704240 ScholiaQ60704240MaRDI QIDQ2795953
Publication date: 23 March 2016
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29221-2_23
Permutations, words, matrices (05A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (2)
Space reduction constraints for the median of permutations problem ⋮ Exploring the median of permutations problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Average parameterization and partial kernelization for computing medians
- Parameterized Enumeration of (Locally-) Optimal Aggregations
- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
- Improved Parameterized Algorithms for the Kemeny Aggregation Problem
- A NEW MEASURE OF RANK CORRELATION
- Graph Drawing
- Aggregating inconsistent information
This page was built for publication: Medians of Permutations: Building Constraints