A polynomial time approximation algorithm for the two-commodity splittable flow problem

DOI10.1007/S00186-012-0402-9MaRDI QIDQ2392809zbMATH OpenOpenAlexFDO

Authors Elke Eisenschmidt, Utz-Uwe Haus

Publication date 2 August 2013

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/20.500.11850/57214

zbMATH Keywords

approximation algorithm2-commodity flowsplittable flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The \(k\)-splittable flow problem
• scientific article; zbMATH DE number 1947385
• Approximation and Online Algorithms
• Maximum \(k\)-splittable \(s, t\)-flows
• Approximation algorithms for single-source unsplittable flow

Cites work

• scientific article; zbMATH DE number 1947385 (Why is no real title available?)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Multi-Commodity Network Flows
• On the Complexity of Timetable and Multicommodity Flow Problems
• The \(k\)-splittable flow problem

Cited in

(4)

• Branch-and-cut for a 2-commodity flow relocation model with time constraints
• scientific article; zbMATH DE number 1947385 (Why is no real title available?)
• Approximation and Online Algorithms
• Complexity and approximability of \(k\)-splittable flows

This page was built for publication: A polynomial time approximation algorithm for the two-commodity splittable flow problem

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