Non-Preemptive Tree Packing

An instance of the non-preemptive tree packing problem consists of an undirected graph [Formula: see text] together with a weight w(e) for every edge [Formula: see text] . The goal is to activate every edge e for some time interval of length w(e), such that the activated edges keep G connected for t...

Descripción completa

Detalles Bibliográficos
Autores principales: Lendl, Stefan, Woeginger, Gerhard, Wulf, Lasse
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9984357/
https://www.ncbi.nlm.nih.gov/pubmed/36883187
http://dx.doi.org/10.1007/s00453-022-01026-7

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9984357/
https://www.ncbi.nlm.nih.gov/pubmed/36883187
http://dx.doi.org/10.1007/s00453-022-01026-7

Ejemplares similares