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

DOI10.1007/S00186-012-0402-9zbMATH Open1272.90104OpenAlexW35377302MaRDI QIDQ2392809FDOQ2392809

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

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

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)

Cites Work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the Complexity of Timetable and Multicommodity Flow Problems
• Multi-Commodity Network Flows
• The \(k\)-splittable flow problem
• Title not available (Why is that?)

Cited In (4)

• Branch-and-cut for a 2-commodity flow relocation model with time constraints
• Title not available (Why is that?)
• 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)