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

Guardat en:

Dades bibliogràfiques
Publicat a:	arXiv.org (Dec 19, 2024), p. n/a
Autor principal:	Li, Xiao
Altres autors:	Guan, Xiucui, Jia, Junhua, Pardalos, Panos M
Publicat:	Cornell University Library, arXiv.org
Matèries:	Lower bounds Dynamic programming Upper bounds Knapsack problem Hardness Polynomials Greedy algorithms Transportation networks Counterterrorism Search algorithms Trees Algorithms Complexity Minimum cost
Accés en línia:	Citation/Abstract Full text outside of ProQuest
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Sigues el primer a deixar un comentari!