EUVIMEDEUVIMED entdecken
Crossref

An approximation algorithm for minimum cost connected Roman dominating set problems

Yaoyao Zhang, Zhao Zhang, Jiao Zhou

Theoretical Computer Science · 2026-12 · 1088 · 116281

DOI: 10.1016/j.tcs.2026.116281 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-12. Verfasst von Yaoyao Zhang und 2 weiteren Autor:innen. Die Arbeit nennt 11 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Zhang, Y., Zhang, Z., & Zhou, J. (2026). An approximation algorithm for minimum cost connected Roman dominating set problems. Theoretical Computer Science, 1088, 116281. https://doi.org/10.1016/j.tcs.2026.116281

Vancouver

Zhang Y, Zhang Z, Zhou J. An approximation algorithm for minimum cost connected Roman dominating set problems. Theoretical Computer Science. 2026;1088:116281. doi:10.1016/j.tcs.2026.116281

BibTeX
@article{Zhang2026,
  author = {Zhang, Yaoyao and Zhang, Zhao and Zhou, Jiao},
  title = {An approximation algorithm for minimum cost connected Roman dominating set problems},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1088},
  pages = {116281},
  doi = {10.1016/j.tcs.2026.116281}
}
Kostenlos starten →