EUVIMEDEUVIMED entdecken
Crossref

Algorithms on partial inverse min–max spanning tree problem under the l∞-norm

Qingzhen Dong, Xianyue Li

Discrete Applied Mathematics · 2027-01 · 396 · 244-257

DOI: 10.1016/j.dam.2026.09.016 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2027-01. Verfasst von Qingzhen Dong und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Gefördert von: National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Dong, Q., & Li, X. (2027). Algorithms on partial inverse min–max spanning tree problem under the l∞-norm. Discrete Applied Mathematics, 396, 244-257. https://doi.org/10.1016/j.dam.2026.09.016

Vancouver

Dong Q, Li X. Algorithms on partial inverse min–max spanning tree problem under the l∞-norm. Discrete Applied Mathematics. 2027;396:244-257. doi:10.1016/j.dam.2026.09.016

BibTeX
@article{Dong2027,
  author = {Dong, Qingzhen and Li, Xianyue},
  title = {Algorithms on partial inverse min–max spanning tree problem under the l∞-norm},
  journal = {Discrete Applied Mathematics},
  year = {2027},
  volume = {396},
  pages = {244--257},
  doi = {10.1016/j.dam.2026.09.016}
}
Kostenlos starten →