Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
From MaRDI portal
Publication:5443388
DOI10.1007/978-3-540-77918-6_21zbMath1130.68342OpenAlexW1566407554MaRDI QIDQ5443388
David P. Williamson, Anke van Zuylen
Publication date: 20 February 2008
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77918-6_21
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (21)
Cluster editing problem for points on the real line: a polynomial time algorithm ⋮ Byzantine preferential voting ⋮ Exact Algorithms for Cluster Editing: Evaluation and Experiments ⋮ A \(2k\) kernel for the cluster editing problem ⋮ Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ Fixed-Parameter Algorithms for Kemeny Scores ⋮ A combinatorial multi-armed bandit approach to correlation clustering ⋮ Experiments with Kemeny ranking: What works when? ⋮ Randomized Algorithms for Lexicographic Inference ⋮ Preference-based learning to rank ⋮ Lower and upper bounds for the linear arrangement problem on interval graphs ⋮ Exact algorithms for cluster editing: Evaluation and experiments ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Fixed-parameter algorithms for cluster vertex deletion ⋮ On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems ⋮ Closest 4-leaf power is fixed-parameter tractable ⋮ A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing ⋮ Fixed-parameter algorithms for Kemeny rankings ⋮ Improved Parameterized Algorithms for the Kemeny Aggregation Problem ⋮ Going weighted: parameterized algorithms for cluster editing ⋮ Going Weighted: Parameterized Algorithms for Cluster Editing
This page was built for publication: Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
