Pages that link to "Item:Q2766482"
From MaRDI portal
The following pages link to The complexity of computing medians of relations. (Q2766482):
Displaying 18 items.
- Ranking data with ordinal labels: optimality and pairwise aggregation (Q374178) (← links)
- A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
- Binary relations: Finite characterizations and computational complexity (Q935039) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists (Q2379921) (← links)
- Noising methods for a clique partitioning problem (Q2489901) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Application of the “descent with mutations” metaheuristic to a clique partitioning problem (Q5242283) (← links)
- A note on clustering aggregation for binary clusterings (Q6556150) (← links)
- Core potentials: the consensus segmentation conjecture (Q6653667) (← links)
