New bounds on the price of anarchy of selfish bin packing with partial punishment
Journal of Combinatorial Optimization · 2025-01 · 49 (1)
DOI: 10.1007/s10878-024-01239-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Optimization, online erschienen am 04.12.2024. Verfasst von Xiaowei Li und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 20 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Li, X., Liu, P., & Lu, X. (2025). New bounds on the price of anarchy of selfish bin packing with partial punishment. Journal of Combinatorial Optimization, 49(1). https://doi.org/10.1007/s10878-024-01239-2
Vancouver
Li X, Liu P, Lu X. New bounds on the price of anarchy of selfish bin packing with partial punishment. Journal of Combinatorial Optimization. 2025;49(1). doi:10.1007/s10878-024-01239-2
BibTeX
@article{Li2025,
author = {Li, Xiaowei and Liu, Peihai and Lu, Xiwen},
title = {New bounds on the price of anarchy of selfish bin packing with partial punishment},
journal = {Journal of Combinatorial Optimization},
year = {2025},
volume = {49},
number = {1},
doi = {10.1007/s10878-024-01239-2}
}
EUVIMED