Clustering in Hypergraphs to Minimize Average Edge Service Time

ACM Transactions on Algorithms, pp. 1-28, 2020.

Cited by: 0|Bibtex|Views9|Links
EI
Keywords:
Clusteringaverage cover timehypergraphsset cover

Abstract:

We study the problem of clustering the vertices of a weighted hypergraph such that on average the vertices of each edge can be covered by a small number of clusters. This problem has many applications, such as for designing medical tests, clustering files on disk servers, and placing network services on servers. The edges of the hypergrap...More

Code:

Data:

Your rating :
0

 

Tags
Comments