A 0.3622-Approximation Algoritm for the Maximum K-Edge-Colored Clustering Problem - Conference attendances

A 0.3622-Approximation Algoritm for the Maximum K-Edge-Colored Clustering Problem Conference attendances

Language

Английский

Participant type

Секционный

Conference

Mathematical Optimization Theory and Operations Research
06-10 Jul 2020 , Новосибирск

Authors

Ageev Alexander ¹ , Kononov Alexander ¹

Affiliations

1	Sobolev Institute of Mathematics

Ageev A. , Kononov A.
A 0.3622-Approximation Algoritm for the Maximum K-Edge-Colored Clustering Problem
Mathematical Optimization Theory and Operations Research 06-10 Jul 2020