Non-Preemptive Tree Packing

Stefan Lendl, Gerhard Woeginger, Lasse Wulf

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Early online date23 Aug 2022
Publication statusE-pub ahead of print - 23 Aug 2022


  • 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


Dive into the research topics of 'Non-Preemptive Tree Packing'. Together they form a unique fingerprint.

Cite this