Improved Approximations for the Max k-Colored Clustering Problem
From MaRDI portal
Publication:3453278
DOI10.1007/978-3-319-18263-6_1zbMath1457.68304OpenAlexW658463892MaRDI QIDQ3453278
No author found.
Publication date: 20 November 2015
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18263-6_1
Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
Clustering on \(k\)-edge-colored graphs, A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem
Cites Work