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

Gardado en:

Detalles Bibliográficos
Publicado en:	arXiv.org (Dec 19, 2024), p. n/a
Autor Principal:	Li, Xiao
Outros autores:	Guan, Xiucui, Jia, Junhua, Pardalos, Panos M
Publicado:	Cornell University Library, arXiv.org
Materias:	Lower bounds Dynamic programming Upper bounds Knapsack problem Hardness Polynomials Greedy algorithms Transportation networks Counterterrorism Search algorithms Trees Algorithms Complexity Minimum cost
Acceso en liña:	Citation/Abstract Full text outside of ProQuest
Etiquetas:	Engadir etiqueta Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

Sexa o primeiro en deixar un comentario!