Deterministic pivoting algorithms for constrained ranking and clustering problems
From MaRDI portal
Recommendations
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Aggregating inconsistent information: ranking and clustering
- Ranking tournaments, local search and a new algorithm
- Ranking tournaments: local search and a new algorithm
Cited in
(15)- Pivoting algorithms based on Boolean vector labeling
- Preference-based learning to rank
- Ranking tournaments with no errors. I: Structural description
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Improved Algorithms for Bicluster Editing
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Finding the closest ultrametric
- The feedback arc set problem with triangle inequality is a vertex cover problem
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Aggregating inconsistent information: ranking and clustering
- Kernels for feedback arc set in tournaments
- Dynamic parameterized feedback problems in tournaments
- A note on generalized rank aggregation
This page was built for publication: Deterministic pivoting algorithms for constrained ranking and clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934620)
