Crossref
Pareto optimal matching with multilayer preferences: How hard can it be?
Theoretical Computer Science · 2026-05 · 1073 · 115901
DOI: 10.1016/j.tcs.2026.115901 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-05. Verfasst von Yinghui Wen und 3 weiteren Autor:innen. Die Arbeit nennt 38 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Wen, Y., Tong, X., Guo, J., & Zhou, A. (2026). Pareto optimal matching with multilayer preferences: How hard can it be?. Theoretical Computer Science, 1073, 115901. https://doi.org/10.1016/j.tcs.2026.115901
Vancouver
Wen Y, Tong X, Guo J, Zhou A. Pareto optimal matching with multilayer preferences: How hard can it be?. Theoretical Computer Science. 2026;1073:115901. doi:10.1016/j.tcs.2026.115901
BibTeX
@article{Wen2026,
author = {Wen, Yinghui and Tong, Xin and Guo, Jiong and Zhou, Aizhong},
title = {Pareto optimal matching with multilayer preferences: How hard can it be?},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1073},
pages = {115901},
doi = {10.1016/j.tcs.2026.115901}
}
EUVIMED