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

Wedi'i Gadw mewn:

Manylion Llyfryddiaeth
Cyhoeddwyd yn:	arXiv.org (Dec 19, 2024), p. n/a
Prif Awdur:	Li, Xiao
Awduron Eraill:	Guan, Xiucui, Jia, Junhua, Pardalos, Panos M
Cyhoeddwyd:	Cornell University Library, arXiv.org
Pynciau:	Lower bounds Dynamic programming Upper bounds Knapsack problem Hardness Polynomials Greedy algorithms Transportation networks Counterterrorism Search algorithms Trees Algorithms Complexity Minimum cost
Mynediad Ar-lein:	Citation/Abstract Full text outside of ProQuest
Tagiau:	Ychwanegu Tag Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!

Byddwch y cyntaf i adael sylw!