Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
From MaRDI portal
Publication:3169053
DOI10.1287/moor.1090.0385zbMath1216.68343OpenAlexW1982119153MaRDI QIDQ3169053
David P. Williamson, Anke van Zuylen
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1090.0385
hierarchical clusteringapproximation algorithmderandomizationrank aggregationcorrelation clusteringconsensus clusteringminimum feedback arc set in tournaments
Analysis of algorithms (68W40) Voting theory (91B12) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)
Related Items (29)
Rank aggregation: new bounds for MCx ⋮ Approximation algorithms for two variants of correlation clustering problem ⋮ Robust Learning of Consumer Preferences ⋮ Cluster Editing ⋮ Space reduction constraints for the median of permutations problem ⋮ Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds ⋮ On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems ⋮ Exploring the median of permutations problem ⋮ Editing graphs into disjoint unions of dense clusters ⋮ Automedian sets of permutations: direct sum and shuffle ⋮ The feedback arc set problem with triangle inequality is a vertex cover problem ⋮ The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders ⋮ Cluster editing: kernelization based on edge cuts ⋮ Linear programming based approximation algorithms for feedback set problems in bipartite tournaments ⋮ Even better fixed-parameter algorithms for bicluster editing ⋮ Average parameterization and partial kernelization for computing medians ⋮ Unnamed Item ⋮ Partial Kernelization for Rank Aggregation: Theory and Experiments ⋮ Cluster Editing: Kernelization Based on Edge Cuts ⋮ Medians of Permutations: Building Constraints ⋮ Ranking tournaments with no errors. I: Structural description ⋮ On the safety of Gomory cut generators ⋮ The Branch and Cut Method for the Clique Partitioning Problem ⋮ A simple and improved parameterized algorithm for bicluster editing ⋮ An Algorithmic View of Voting ⋮ COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES ⋮ Tournaments and Semicomplete Digraphs ⋮ Multidimensional welfare rankings under weight imprecision: a social choice perspective ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms
Uses Software
This page was built for publication: Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
