A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time
DOI10.4230/LIPICS.ICALP.2017.67zbMATH Open1441.68291OpenAlexW2742062324MaRDI QIDQ5111398FDOQ5111398
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)
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-Parameter Approximation Schemes for Weighted Flowtime.
- Title not available (Why is that?)
- A logarithmic approximation for unsplittable flow on line graphs
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
- Approximations for generalized unsplittable flow on paths with application to power systems optimization
- Fixed-parameter algorithms for unsplittable flow cover
- A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
- Closing the Gap for Pseudo-Polynomial Strip Packing
This page was built for publication: A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111398)
