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

Saved in:

Bibliographic Details
Published in:	arXiv.org (Dec 19, 2024), p. n/a
Main Author:	Li, Xiao
Other Authors:	Guan, Xiucui, Jia, Junhua, Pardalos, Panos M
Published:	Cornell University Library, arXiv.org
Subjects:	Lower bounds Dynamic programming Upper bounds Knapsack problem Hardness Polynomials Greedy algorithms Transportation networks Counterterrorism Search algorithms Trees Algorithms Complexity Minimum cost
Online Access:	Citation/Abstract Full text outside of ProQuest
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!