Crossref
Tight linear inapproximability for the temporal graph exploration problem
Theoretical Computer Science · 2026-12 · 1088 · 116282
DOI: 10.1016/j.tcs.2026.116282 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-12. Verfasst von Masaki Yamamoto. Die Arbeit nennt 5 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Yamamoto, M. (2026). Tight linear inapproximability for the temporal graph exploration problem. Theoretical Computer Science, 1088, 116282. https://doi.org/10.1016/j.tcs.2026.116282
Vancouver
Yamamoto M. Tight linear inapproximability for the temporal graph exploration problem. Theoretical Computer Science. 2026;1088:116282. doi:10.1016/j.tcs.2026.116282
BibTeX
@article{Yamamoto2026,
author = {Yamamoto, Masaki},
title = {Tight linear inapproximability for the temporal graph exploration problem},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1088},
pages = {116282},
doi = {10.1016/j.tcs.2026.116282}
}
EUVIMED