Arushi Srinivasan

Edge-colored Clustering in Hypergraphs: A MaxECC Approximation

We study the \maxecc\ problem, where given an edge-colored hypergraph with $k$ colors and edge size $r$, we seek to color the vertices of the graph in order to maximize the number of satisfied edges (edges having the same color as their extremities): this is an effective mechanism for clustering (co…