Better Approximations for General Caching and UFP-Cover Under Resource Augmentation

Andrés Cristi & Andreas Wiese
In the Unsplittable Flow on a Path Cover (UFP-cover) problem we are given a path with a demand for each edge and a set of tasks where each task is defined by a subpath, a size and a cost. The goal is to select a subset of the tasks of minimum cost that together cover the demand of each edge. This problem models various resource allocation settings and also the general caching problem. The best...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.