Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges

Spremljeno u:

Bibliografski detalji
Izdano u:	arXiv.org (Dec 19, 2024), p. n/a
Glavni autor:	Li, Xiao
Daljnji autori:	Guan, Xiucui, Jia, Junhua, Pardalos, Panos M
Izdano:	Cornell University Library, arXiv.org
Teme:	Lower bounds Dynamic programming Upper bounds Knapsack problem Hardness Polynomials Greedy algorithms Transportation networks Counterterrorism Search algorithms Trees Algorithms Complexity Minimum cost
Online pristup:	Citation/Abstract Full text outside of ProQuest
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!

Budi prvi tko komentira!