The complexity of computing medians of relations.
From MaRDI portal
Recommendations
- On the computation of median linear orders, of median complete preorders and of median weak orders
- Complexity results for extensions of median orders to different types of remoteness
- scientific article; zbMATH DE number 3980481
- NP-hardness results for the aggregation of linear orders into median orders
- NP-hardness of the computation of a median equivalence relation in classification (Régnier's problem)
Cited in
(21)- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- On the parameterized complexity of consensus clustering
- NP-hardness results for the aggregation of linear orders into median orders
- Complexity results for extensions of median orders to different types of remoteness
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Noising methods for a clique partitioning problem
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Ranking data with ordinal labels: optimality and pairwise aggregation
- scientific article; zbMATH DE number 3980481 (Why is no real title available?)
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
- On the computation of median linear orders, of median complete preorders and of median weak orders
- Voting procedures, complexity of
- Application of the ``descent with mutations metaheuristic to a clique partitioning problem
- NP-hardness of the computation of a median equivalence relation in classification (Régnier's problem)
- Median for an odd number of linear order relations and its use in group choice problems
- A note on clustering aggregation for binary clusterings
- Core potentials: the consensus segmentation conjecture
- Average parameterization and partial kernelization for computing medians
- On the approximation of correlation clustering and consensus clustering
- Binary relations: Finite characterizations and computational complexity
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
This page was built for publication: The complexity of computing medians of relations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766482)
