Clustering on \(k\)-edge-colored graphs

DOI10.1016/j.dam.2016.04.017zbMath1348.05070OpenAlexW2350862829MaRDI QIDQ335326

Evripidis Bampis, Eric Angel, Alexander V. Kononov, Emmanouil Pountourakis, Dimitris Paparas, Vassilios Zissimopoulos

Publication date: 2 November 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.017

zbMATH Keywords

clusteringcoloringapproximation algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items

Non-existence of stable social groups in information-driven networks ⋮ A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem ⋮ How long does it take for all users in a social network to choose their communities?

Cites Work

• Unnamed Item
• Correlation clustering
• Information-sharing in social networks
• Improved Approximations for the Max k-Colored Clustering Problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems