Clustering on k-Edge-Colored Graphs

DOI10.1007/978-3-642-40313-2_7zbMath1398.68384OpenAlexW2122131518MaRDI QIDQ2849897

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

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40313-2_7

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Improved Approximations for the Max k-Colored Clustering Problem ⋮ A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem

This page was built for publication: Clustering on k-Edge-Colored Graphs