@inproceedings{e0d50860ba3748918d2048b28b6a30aa,
title = "Approximability and inapproximability for maximum k-edge-colored clustering problem",
abstract = "We consider the Max k-Edge-Colored Clustering problem (abbreviated as MAX-k-EC). We are given an edge-colored graph with k colors. Each edge of the graph has a positive weight. We seek to color the vertices of the graph so as to maximize the total weight of the edges which have the same color at their extremities. The problem was introduced by Angel et al. [2]. We give a polynomial-time algorithm for MAX-k-EC with an approximation factor (formula presented), which significantly improves the best previously known factor (formula presented), obtained by Ageev and Kononov [1]. We also present an upper bound of (formula presented) on the inapproximability of MAX-k-EC. This is the first inapproximability result for this problem.",
keywords = "Clustering, Edge-colored graph, Randomized rounding, APPROXIMATION ALGORITHMS",
author = "Alhamdan, {Yousef M.} and Alexander Kononov",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-19955-5_1",
language = "English",
isbn = "9783030199548",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer-Verlag GmbH and Co. KG",
pages = "1--12",
editor = "{van Bevern}, Ren{\'e} and Gregory Kucherov",
booktitle = "Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings",
address = "Germany",
note = "14th International Computer Science Symposium in Russia, CSR 2019 ; Conference date: 01-07-2019 Through 05-07-2019",
}