Approximability and inapproximability for maximum \(k\)-edge-colored clustering problem
From MaRDI portal
Publication:2330548
DOI10.1007/978-3-030-19955-5_1zbMath1494.68185OpenAlexW2952132033MaRDI QIDQ2330548
Publication date: 22 October 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-19955-5_1
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25) Signed and weighted graphs (05C22)
Related Items (1)
This page was built for publication: Approximability and inapproximability for maximum \(k\)-edge-colored clustering problem
