Crossref
Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions
SN Computer Science · 01.02.2024 · 5 (2)
DOI: 10.1007/s42979-023-02548-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift SN Computer Science, online erschienen am 01.02.2024. Verfasst von Charles J. Colbourn. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 118 Literaturangaben. Gefördert von: National Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Science Foundation
Zitieren
APA
Colbourn, C. J. (2024). Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions. SN Computer Science, 5(2). https://doi.org/10.1007/s42979-023-02548-9
Vancouver
Colbourn CJ. Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions. SN Computer Science. 2024;5(2). doi:10.1007/s42979-023-02548-9
BibTeX
@article{Colbourn2024,
author = {Colbourn, Charles J.},
title = {Efficient Greedy Algorithms with Accuracy Guarantees for Combinatorial Restrictions},
journal = {SN Computer Science},
year = {2024},
volume = {5},
number = {2},
doi = {10.1007/s42979-023-02548-9}
}
EUVIMED