Related Experiment Video
Updated: Aug 7, 2025

Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis
Published on: September 22, 2023
Non-Preemptive Tree Packing
Stefan Lendl1, Gerhard Woeginger2, Lasse Wulf3
1Department of Operations and Information Systems, University of Graz, Graz, Styria Austria.
Abstract:
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. 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.
Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a...
Law of Independent Assortment
Phylogenetic Trees
Maximum Power Flow and Line Loadability
Compacting Factor test
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...
Chromatin Packaging

