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

Shranjeno v:

Bibliografske podrobnosti
izdano v:	arXiv.org (Dec 19, 2024), p. n/a
Glavni avtor:	Li, Xiao
Drugi avtorji:	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 dostop:	Citation/Abstract Full text outside of ProQuest
Oznake:	Označite Brez oznak, prvi označite!

Komentirajte kot prvi!