Login / Signup
A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees.
Pawel Bialon
Published in:
Telecommun. Syst. (2017)
Keyphrases
</>
quality guarantees
upper bound
optimal solution
lower bound
mixed integer
approximation methods
linear programming
error bounds
solution space