PROOF. We show a constructive proof. First, initialize the set V to N. Then, remove all nodes with zero demand from V . Each node x defines βx, where βx = α wxj . Furthermore, let Z(y)= {z : dzy ≤ βz,z∈ V}; Z(y) represents all nodes z for which y lies within βz from z.