A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time
From MaRDI portal
Publication:5111398
DOI10.4230/LIPIcs.ICALP.2017.67zbMath1441.68291OpenAlexW2742062324MaRDI QIDQ5111398
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.67
combinatorial optimizationapproximation algorithmsfixed-parameter algorithmsunsplittable flow on a path
Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25) Flows in graphs (05C21) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (5)
Unnamed Item ⋮ Fixed-parameter algorithms for unsplittable flow cover ⋮ Fixed-Parameter Approximation Schemes for Weighted Flowtime. ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing ⋮ Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
This page was built for publication: A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time
