36 citations · 122 across the 33 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2018
A Note on Clustering Aggregation for Binary Clusterings
Jiehua Chen, Danny Hermelin, Manuel Sorge
We consider the clustering aggregation problem in which we are given a set of clusterings and want to find an aggregated clustering which minimizes the sum of mismatches to the inp…
cs.CC2018★ 4 cited
On Computing Centroids According to the -Norms of Hamming Distance Vectors
Jiehua Chen, Danny Hermelin, Manuel Sorge
In this paper we consider the -Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the -norm of its Hammin…
cs.CC2017
How hard is it to satisfy (almost) all roommates?
Jiehua Chen, Danny Hermelin, Manuel Sorge +1
The classic Stable Roommates problem (which is the non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set o…