A simple approximation algorithm for k-correlation clustering on uniform hypergraphs
Theoretical Computer Science · 2026-07 · 1079 · 116041
DOI: 10.1016/j.tcs.2026.116041 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-07. Verfasst von Zhongzheng Tang und 2 weiteren Autor:innen. Die Arbeit nennt 10 Literaturangaben. Gefördert von: Fundamental Research Funds for the Central Universities, National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Fundamental Research Funds for the Central Universities
- National Natural Science Foundation of China
Zitieren
APA
Tang, Z., Li, Y., & Diao, Z. (2026). A simple approximation algorithm for k-correlation clustering on uniform hypergraphs. Theoretical Computer Science, 1079, 116041. https://doi.org/10.1016/j.tcs.2026.116041
Vancouver
Tang Z, Li Y, Diao Z. A simple approximation algorithm for k-correlation clustering on uniform hypergraphs. Theoretical Computer Science. 2026;1079:116041. doi:10.1016/j.tcs.2026.116041
BibTeX
@article{Tang2026,
author = {Tang, Zhongzheng and Li, Yaxuan and Diao, Zhuo},
title = {A simple approximation algorithm for k-correlation clustering on uniform hypergraphs},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1079},
pages = {116041},
doi = {10.1016/j.tcs.2026.116041}
}
EUVIMED