To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack

DOI10.1137/1.9781611974782.159zbMath1411.68188OpenAlexW4247372595MaRDI QIDQ4575908

Tobias Mömke, Andreas Wiese, Fabrizio Grandoni, Hang Zhou

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.159

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (4)

A knapsack intersection hierarchy ⋮ Fixed-parameter algorithms for unsplittable flow cover ⋮ Unnamed Item ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing

This page was built for publication: To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack