Design of trees in the hose model: The balanced case

In the hose model we are given upper bounds bu-/bu+ on the amount of traffic entering/leaving a node. We show that when ∑u∈Vbu+=∑v∈Vbu-, designing a minimum cost tree network is easy and the cost of an optimal tree reservation is within a factor of three of the cost of any reservation.