//-->
Heuristics with constant error guarantees for the design of tree networks
Altinkemer, Kemal, (1988)
On the complexity of Convex Hull Algorithms if rotational minima can be found very fast
Huckenbeck, Ulrich, (1988)
Approximations for the random minimal spanning tree with application to network provisioning
Jain, Anjani, (1988)
On a multi-period assignment problem
Werra, D. de, (1977)
An introduction to timetabling
Werra, D. de, (1985)
On the two-phase method for preemptive scheduling
Werra, D. de, (1988)