A Mazing 2+ε Approximation for Unsplittable Flow on a Path

DOI10.1145/3242769zbMath1422.68278OpenAlexW2891839364WikidataQ116754381 ScholiaQ116754381MaRDI QIDQ4629969

Andreas Wiese, Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi

Publication date: 28 March 2019

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3242769

zbMATH Keywords

approximation algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Flows in graphs (05C21)

Related Items (2)

Improved algorithms for scheduling unsplittable flows on paths ⋮ Approximation algorithms for the generalized incremental knapsack problem

This page was built for publication: A Mazing 2+ε Approximation for Unsplittable Flow on a Path