External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem

Yousef M. Alhamdan, Alexander Kononov. Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. In René van Bevern, Gregory Kucherov, editors, Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings. Volume 11532 of Lecture Notes in Computer Science, pages 1-12, Springer, 2019. [doi]

Authors

Yousef M. Alhamdan

This author has not been identified. Look up 'Yousef M. Alhamdan' in Google

Alexander Kononov

This author has not been identified. Look up 'Alexander Kononov' in Google
runs on