Fixed-Parameter Algorithms for Unsplittable Flow Cover
Sign Up to like & getrecommendations! Published in 2021 at "Theory of Computing Systems"
DOI: 10.1007/s00224-021-10048-7
Abstract: 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… read more here.
Keywords: cover; problem; fixed parameter; unsplittable flow ... See more keywords