New Algorithms for the Unsplittable Flow Problem

DOI10.1007/11751588_117MaRDI QIDQ3599041zbMATH OpenOpenAlexFDO

Authors Krzysztof Walkowiak

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

zbMATH Keywords

survivabilityconnection-oriented networkUFP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Network design and communication in computer systems (68M10)

Recommendations

• Combinatorial algorithms for the unsplittable flow problem
• scientific article; zbMATH DE number 1947047
• Approximation algorithms for single-source unsplittable flow
• Improved bounds for the unsplittable flow problem
• scientific article; zbMATH DE number 1757944

Cited in

(6)

• scientific article; zbMATH DE number 7278054 (Why is no real title available?)
• Unsplittable Anycast Flow Problem: Formulation and Algorithms
• A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints
• Combinatorial algorithms for the unsplittable flow problem
• On the single-source unsplittable flow problem
• Approximation algorithms for the unsplittable flow problem

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)