Open Access · CC BY 4.0
Minimizing the weighted number of tardy jobs is W[1]-hard
Journal of Computer and System Sciences · 2026-11 · 161 · 103817
DOI: 10.1016/j.jcss.2026.103817 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer and System Sciences, 2026-11. Verfasst von Klaus Heeger und 1 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Israel Science Foundation, Islamic Scholarship Fund.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Israel Science Foundation
- Islamic Scholarship Fund
Zitieren
APA
Heeger, K., & Hermelin, D. (2026). Minimizing the weighted number of tardy jobs is W[1]-hard. Journal of Computer and System Sciences, 161, 103817. https://doi.org/10.1016/j.jcss.2026.103817
Vancouver
Heeger K, Hermelin D. Minimizing the weighted number of tardy jobs is W[1]-hard. Journal of Computer and System Sciences. 2026;161:103817. doi:10.1016/j.jcss.2026.103817
BibTeX
@article{Heeger2026,
author = {Heeger, Klaus and Hermelin, Danny},
title = {Minimizing the weighted number of tardy jobs is W[1]-hard},
journal = {Journal of Computer and System Sciences},
year = {2026},
volume = {161},
pages = {103817},
doi = {10.1016/j.jcss.2026.103817}
}
EUVIMED