FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees

DOI10.4230/LIPICS.ESA.2021.67OpenAlexW3197971022MaRDI QIDQ6075962

Unnamed Author, Andreas Wiese

Publication date: 20 September 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2021.67

zbMATH Keywords

treespacking problemsunsplittable flowFPT algorithmsFPT-approximation algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees