FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees

DOI10.4230/LIPICS.ESA.2021.67MaRDI QIDQ6075962zbMATH OpenOpenAlexFDO

Authors Andreas Wiese

Publication date 20 September 2023

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

zbMATH Keywords

FPT algorithmsFPT-approximation algorithmspacking problemstreesunsplittable flow

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Submodular unsplittable flow on trees
• Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
• scientific article; zbMATH DE number 6861995 (Why is no real title available?)
• scientific article; zbMATH DE number 7310159 (Why is no real title available?)
• The parameterized complexity landscape of the unsplittable flow problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6075962)