A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees

In 2005, Baier et al. introduced a “k-splittable” variant of the multicommodity flow (MCF) problem in which a given commodity was allowed to flow through a number of paths limited by a small integer. This problem enables a better use of the link capacities than the classical Kleinberg’s unsplittable MCF problem while not overloading the used devices and protocols with a large number of paths. We solve a minimum-congestion k-splittable MCF...