Improved Approximations for the Max k-Colored Clustering Problem

Journal

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Output data

Year: 2015, Pages: 1-10 Pages count : 10 DOI: 10.1007/978-3-319-18263-6_1

Tags

Clustering; Edge-colored graph; Linear relaxation; Randomized rounding; Worst case behavior analysis

Authors

Ageev Alexander ¹ , Kononov Alexander ^1,2

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Ageev A. , Kononov A.
Improved Approximations for the Max k-Colored Clustering Problem
Lecture Notes in Computer Science. 2015. P.1-10. DOI: 10.1007/978-3-319-18263-6_1 WOS Scopus OpenAlex