Design of trees in the hose model: The balanced case

0.00 Avg rating—0 Votes

Article ID:	iaor20073065
Country:	Netherlands
Volume:	34
Issue:	6
Start Page Number:	601
End Page Number:	606
Publication Date:	Nov 2006
Journal:	Operations Research Letters
Authors:	Oriolo Gianpaolo, Italiano Giuseppe, Leonardi Stefano
Keywords:	communication

Abstract:

In the hose model we are given upper bounds b⁻u/b⁺u on the amount of traffic entering/leaving a node. We show that when ∑u∈Vb⁺u = ∑v∈Vb⁻u, 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.

Reviews

Required fields are marked *. Your email address will not be published.