Fixed-Parameter Algorithms for Unsplittable Flow Cover

Andrés Cristi, Mathieu Mari & Andreas Wiese
The Unsplittable Flow Cover problem (UFP-cover) models the well-studied general caching problem and various natural resource allocation settings. We are given a path with a demand on each edge and a set of tasks, each task being defined by a subpath and a size. The goal is to select a subset of the tasks of minimum cardinality such that on each edge e the total size of the selected tasks using e is at least...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.