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
_version_ 1784900729941524480
author Lendl, Stefan
Woeginger, Gerhard
Wulf, Lasse
author_facet Lendl, Stefan
Woeginger, Gerhard
Wulf, Lasse
author_sort Lendl, Stefan
collection PubMed
description 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 the longest possible overall time. We derive a variety of results on this problem. The problem is strongly NP-hard even on graphs of treewidth 2, and it does not allow a polynomial time approximation scheme (unless P=NP). Furthermore, we discuss the performance of a simple greedy algorithm, and we construct and analyze a number of parameterized and exact algorithms.
format Online
Article
Text
id pubmed-9984357
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher Springer US
record_format MEDLINE/PubMed
spelling pubmed-99843572023-03-05 Non-Preemptive Tree Packing Lendl, Stefan Woeginger, Gerhard Wulf, Lasse Algorithmica Article 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 the longest possible overall time. We derive a variety of results on this problem. The problem is strongly NP-hard even on graphs of treewidth 2, and it does not allow a polynomial time approximation scheme (unless P=NP). Furthermore, we discuss the performance of a simple greedy algorithm, and we construct and analyze a number of parameterized and exact algorithms. Springer US 2022-08-23 2023 /pmc/articles/PMC9984357/ /pubmed/36883187 http://dx.doi.org/10.1007/s00453-022-01026-7 Text en © The Author(s) 2022 https://creativecommons.org/licenses/by/4.0/Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) .
spellingShingle Article
Lendl, Stefan
Woeginger, Gerhard
Wulf, Lasse
Non-Preemptive Tree Packing
title Non-Preemptive Tree Packing
title_full Non-Preemptive Tree Packing
title_fullStr Non-Preemptive Tree Packing
title_full_unstemmed Non-Preemptive Tree Packing
title_short Non-Preemptive Tree Packing
title_sort non-preemptive tree packing
topic Article
url 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
work_keys_str_mv AT lendlstefan nonpreemptivetreepacking
AT woegingergerhard nonpreemptivetreepacking
AT wulflasse nonpreemptivetreepacking

Ejemplares similares