Max-edge-coloured clustering problem: old and new results - Conference attendances

Max-edge-coloured clustering problem: old and new results Conference attendances

Language

Английский

Participant type

Пленарный

Conference

China-Russia International Academic Symposium on "Digital and Intelligent Mathematics and Smart Water Resources Engineering"
18-20 Sep 2026 , China Three Gorges University, Ичан, Китай

Authors

Kononov A ¹

Affiliations

1	Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, Novosibirsk, 630090, Russia

We study the Max edge-colored clustering problem, where, given an edge-colored graph with k colors, we seek to find a clustering (coloring) of the vertices maximizing the number (or the weight) of matched edges, i.e. the edges whose extremities are colored with the same color as them. We discuss results on combinatorial complexity and approximability.

Kononov A.
Max-edge-coloured clustering problem: old and new results
China-Russia International Academic Symposium on "Digital and Intelligent Mathematics and Smart Water Resources Engineering" 18-20 Sep 2026