Charles Explorer logo
🇬🇧

A Note on the Greedy Algorithm for the Unsplittable Flow Problem

Publication at Faculty of Mathematics and Physics |
2003

Abstract

We show that the ideas of Chekuri and Khanna can be used for more general Unsplittable Flow Problem.