Approximation algorithms for non-sequential star packing problems
Information and Computation · 2026-01 · 308 · 105397
DOI: 10.1016/j.ic.2025.105397 ↗Kurz gefasst
Fachartikel in der Zeitschrift Information and Computation, 2026-01. Verfasst von Mengyuan Hu und 4 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Ministry of Science and Technology of the People's Republic of China, National Natural Science Foundation of China, Natural Sciences and Engineering Research Council of Canada.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Ministry of Science and Technology of the People's Republic of China
- National Natural Science Foundation of China
- Natural Sciences and Engineering Research Council of Canada
- Natural Science Foundation of Zhejiang Province
- China Scholarship Council
Zitieren
APA
Hu, M., Zhang, A., Chen, Y., Gong, M., & Lin, G. (2026). Approximation algorithms for non-sequential star packing problems. Information and Computation, 308, 105397. https://doi.org/10.1016/j.ic.2025.105397
Vancouver
Hu M, Zhang A, Chen Y, Gong M, Lin G. Approximation algorithms for non-sequential star packing problems. Information and Computation. 2026;308:105397. doi:10.1016/j.ic.2025.105397
BibTeX
@article{Hu2026,
author = {Hu, Mengyuan and Zhang, An and Chen, Yong and Gong, Mingyang and Lin, Guohui},
title = {Approximation algorithms for non-sequential star packing problems},
journal = {Information and Computation},
year = {2026},
volume = {308},
pages = {105397},
doi = {10.1016/j.ic.2025.105397}
}
EUVIMED