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 ... ...
