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...
Uložené v:
| Vydané v: | Theory of computing systems Ročník 67; číslo 1; s. 89 - 124 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Springer US
01.02.2023
Springer Nature B.V |
| Predmet: | |
| 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!
|
| Shrnutí: | 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 the demand of
e
. There is a polynomial time 4-approximation for the problem (Bar-Noy et al. STOC
2001
) and also a QPTAS (Höhn et al. ICALP
2018
). In this paper we study fixed-parameter algorithms for the problem. We show that it is W[1]-hard but it becomes FPT if we can slighly violate the edge demands (resource augmentation) and also if there are at most
k
different task sizes. Then we present a parameterized approximation scheme (PAS), i.e., an algorithm with a running time of
f
(
k
)
⋅
n
O
𝜖
(
1
)
that outputs a solution with at most (1 +
𝜖
)
k
tasks or asserts that there is no solution with at most
k
tasks. In this algorithm we use a new trick that intuitively allows us to pretend that we can select tasks from
OPT
multiple times. We show that the other two algorithms extend also to the weighted case of the problem, at the expense of losing a factor of 1 +
𝜖
in the cost of the selected tasks. |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 1432-4350 1433-0490 |
| DOI: | 10.1007/s00224-021-10048-7 |