Algorithms – ESA 2004
From MaRDI portal
Publication:5464610
DOI10.1007/b100428zbMath1111.68786OpenAlexW2483610301MaRDI QIDQ5464610
Martin Skutella, Maren Martens
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (4)
Complexity and approximability of \(k\)-splittable flows ⋮ Maximum \(k\)-splittable \(s, t\)-flows ⋮ On the approximation of the single source \(k\)-splittable flow problem ⋮ A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
This page was built for publication: Algorithms – ESA 2004
