The talk will be about algorithms for the unsplittable flow problem and its generalization the k-splittable flow problem where the number of paths used by a commodity is bounded by k. For the unsplittable flow problem I will prove a lower bound on the performance of randomized rounding. Furthermore I will give approximation algorithms for the k-splittable flow problem with additional constraints on the amount of flow being sent along each path.