A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem

DOI10.1007/978-3-030-58657-7_1zbMath1460.90147OpenAlexW3086307499MaRDI QIDQ4965094

No author found.

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_1

zbMATH Keywords

approximation algorithmclustering problemworst-case analysislinear relaxationedge-colored graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Clustering on \(k\)-edge-colored graphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Approximability and inapproximability for maximum \(k\)-edge-colored clustering problem
• Information-sharing in social networks
• Clustering on k-Edge-Colored Graphs
• Improved Approximations for the Max k-Colored Clustering Problem

This page was built for publication: A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem