Fixed-parameter algorithms for unsplittable flow cover

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...

Full description

Bibliographic Details

Published in:	Theory of computing systems Vol. 154; pp. 1 - 36
Main Authors:	Cristi, Andrés, Mari, Mathieu, Wiese, Andreas
Format:	Journal Article
Language:	English
Published:	Springer Verlag 01.03.2020
Subjects:	Computer Science approximation al- gorithms fixed parameter algorithms Unsplittable Flow Cover
ISSN:	1432-4350, 1433-0490
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!