DOI 10.1007s00453-005-1167-9 The k-Splittable Flow Problem 1.pdfVIP

DOI: 10.1007/s00453-005-1167-9 Algorithmica (2005) 42: 231–248 Algorithmica ? 2005 Springer Science+Business Media, Inc. The k-Splittable Flow Problem1 Georg Baier,2 Ekkehard Ko?hler,2 and Martin Skutella3 Abstract. In traditional multi-commodity flow theory, the task is to send a certain amount of each commodity from its start to its target node, subject to capacity constraints on the edges. However, no restriction is imposed on the number of paths used for delivering each commodity; it is thus feasible to spread the flow over a large number of different paths. Motivated by routing problems a