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

Sábháilte in:

Sonraí bibleagrafaíochta
Foilsithe in:	arXiv.org (Dec 19, 2024), p. n/a
Príomhchruthaitheoir:	Li, Xiao
Rannpháirtithe:	Guan, Xiucui, Jia, Junhua, Pardalos, Panos M
Foilsithe / Cruthaithe:	Cornell University Library, arXiv.org
Ábhair:	Lower bounds Dynamic programming Upper bounds Knapsack problem Hardness Polynomials Greedy algorithms Transportation networks Counterterrorism Search algorithms Trees Algorithms Complexity Minimum cost
Rochtain ar líne:	Citation/Abstract Full text outside of ProQuest
Clibeanna:	Cuir clib leis Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!

Bí ar an gcéad duine le trácht a dhéanamh!