Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CSR
/
Paper
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem.
Yousef M. Alhamdan
,
Alexander V. Kononov
Venue
National
CSR
Year
2019
Proceedings
CSR
DBLP record
conf/csr/AlhamdanK19 ↗
Browse the full
CSR paper archive
.