Small additive error for unsplittable multicommodity flow in outerplanar graphs

DOI10.1007/978-3-031-81396-2_12MaRDI QIDQ6974410zbMATH OpenFDO

Authors Richard Shapley, David B. Shmoys

Publication date 6 June 2025

Full work available at URL https://doi.org/10.1007/978-3-031-81396-2_12

zbMATH Keywords

approximation algorithmsload balancingmulticommodity flowunsplittable flow

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites work

• A linear-time algorithm for edge-disjoint paths in planar graphs
• A note on the ring loading problem
• About groups of straight lines
• An improved upper bound for the ring loading problem
• Approximation algorithms for the unsplittable flow problem
• Improved bounds for the unsplittable flow problem
• Multicommodity flows in planar graphs
• On the single-source unsplittable flow problem
• Parameterized algorithms
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Single-source unsplittable flows in planar graphs
• The Ring Loading Problem

Cited in

(1)

• Unsplittable multicommodity flows in outerplanar graphs

This page was built for publication: Small additive error for unsplittable multicommodity flow in outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974410)