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

Celý popis

Podrobná bibliografia

Vydané v:	Theory of computing systems Ročník 154; s. 1 - 36
Hlavní autori:	Cristi, Andrés, Mari, Mathieu, Wiese, Andreas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Springer Verlag 01.03.2020
Predmet:	Computer Science approximation al- gorithms fixed parameter algorithms Unsplittable Flow Cover
ISSN:	1432-4350, 1433-0490
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!