Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows

DOI10.1007/978-3-319-28684-6_2zbMath1422.68297OpenAlexW2406451287MaRDI QIDQ2788987

Salvatore Ingala, Fabrizio Grandoni, Sumedha Uniyal

Publication date: 26 February 2016

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28684-6_2

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 (4)

Improved algorithms for resource allocation under varying capacity ⋮ Approximation algorithms for the generalized incremental knapsack problem ⋮ Complex-demand scheduling problem with application in smart grid ⋮ Submodular unsplittable flow on trees

This page was built for publication: Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows