New Algorithms for the Unsplittable Flow Problem
From MaRDI portal
Publication:3599041
DOI10.1007/11751588_117zbMATH Open1170.68319OpenAlexW1557080096MaRDI QIDQ3599041
Publication date: 3 February 2009
Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11751588_117
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Approximation algorithms for the unsplittable flow problem ⋮ On the single-source unsplittable flow problem ⋮ Title not available (Why is that?) ⋮ A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints
This page was built for publication: New Algorithms for the Unsplittable Flow Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599041)
