Projects per year
Abstract
An instance of the non-preemptive tree packing problem consists of an undirected graph G=(V,E) together with a weight w(e) for every edge e∈E. 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.
Original language | English |
---|---|
Journal | Algorithmica |
Early online date | 23 Aug 2022 |
DOIs | |
Publication status | E-pub ahead of print - 23 Aug 2022 |
Keywords
- Spanning tree packing
- Non-preemptive scheduling
- Combinatorial optimization
- Timevarying graphs
- Keeping a network connected over time
ASJC Scopus subject areas
- Applied Mathematics
- Computer Science(all)
- Computer Science Applications
Projects
- 1 Active
-
Doctoral Program: Discrete Mathematics
Ebner, O., Lehner, F., Greinecker, F., Burkard, R., Wallner, J., Elsholtz, C., Woess, W., Raseta, M., Bazarova, A., Krenn, D., Lehner, F., Kang, M., Tichy, R., Sava-Huss, E., Klinz, B., Heuberger, C., Grabner, P., Barroero, F., Cuno, J., Kreso, D., Berkes, I. & Kerber, M.
1/05/10 → 30/06/24
Project: Research project