Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, April 28, 2022, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Lasse Wulf (TU Graz)
An instance of the non-preemptive tree packing problem consists of an undirected graph together with a weight w(e) for every edge. 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. This problem can be understood as a variant of the classical tree-packing problem of Nash-Williams, with an additional constraint that enforces "non-preemptiveness". 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.
Automatic MiSe System Software Version 1.4803M | admin login