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

Furkejuvvon:

Bibliográfalaš dieđut
Publikašuvnnas:	arXiv.org (Dec 19, 2024), p. n/a
Váldodahkki:	Li, Xiao
Eará dahkkit:	Guan, Xiucui, Jia, Junhua, Pardalos, Panos M
Almmustuhtton:	Cornell University Library, arXiv.org
Fáttát:	Lower bounds Dynamic programming Upper bounds Knapsack problem Hardness Polynomials Greedy algorithms Transportation networks Counterterrorism Search algorithms Trees Algorithms Complexity Minimum cost
Liŋkkat:	Citation/Abstract Full text outside of ProQuest
Fáddágilkorat:	Lasit fáddágilkoriid Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!

Lasit vuosttaš kommeantta. Visot kommeanttat leat almmolaččat.!