scientific article
From MaRDI portal
Publication:2766482
zbMath1098.68618MaRDI QIDQ2766482
Publication date: 28 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Ranking data with ordinal labels: optimality and pairwise aggregation ⋮ 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 ⋮ On the approximation of correlation clustering and consensus clustering ⋮ Voting Procedures, Complexity of ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Noising methods for a clique partitioning problem ⋮ On the parameterized complexity of consensus clustering ⋮ NP-hardness results for the aggregation of linear orders into median orders ⋮ Average parameterization and partial kernelization for computing medians ⋮ Application of the “descent with mutations” metaheuristic to a clique partitioning problem ⋮ Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem ⋮ Complexity results for extensions of median orders to different types of remoteness
Uses Software
This page was built for publication: