EUVIMEDEUVIMED entdecken
Crossref

Approximation algorithms for the capacitated min-max and minimum graph cover problems

Jiafeng Xiong, Zhaohui Liu, Wei Yu

Theoretical Computer Science · 2026-07 · 1079 · 116038

DOI: 10.1016/j.tcs.2026.116038 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-07. Verfasst von Jiafeng Xiong und 2 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben. Gefördert von: Shanghai Municipal Natural Science Foundation, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Shanghai Municipal Natural Science Foundation
  • National Natural Science Foundation of China

Zitieren

APA

Xiong, J., Liu, Z., & Yu, W. (2026). Approximation algorithms for the capacitated min-max and minimum graph cover problems. Theoretical Computer Science, 1079, 116038. https://doi.org/10.1016/j.tcs.2026.116038

Vancouver

Xiong J, Liu Z, Yu W. Approximation algorithms for the capacitated min-max and minimum graph cover problems. Theoretical Computer Science. 2026;1079:116038. doi:10.1016/j.tcs.2026.116038

BibTeX
@article{Xiong2026,
  author = {Xiong, Jiafeng and Liu, Zhaohui and Yu, Wei},
  title = {Approximation algorithms for the capacitated min-max and minimum graph cover problems},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1079},
  pages = {116038},
  doi = {10.1016/j.tcs.2026.116038}
}
Kostenlos starten →