Approximation and Online Algorithms
From MaRDI portal
Publication:5898477
DOI10.1007/11671411zbMath1177.90393MaRDI QIDQ5898477
Martin Skutella, Ronald Koch, Ines Spenke
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem, Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem, A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem, Complexity and approximability of \(k\)-splittable flows, An exact approach for the maximum concurrent \(k\)-splittable flow problem, On the approximation of the single source \(k\)-splittable flow problem, A Branch and Price algorithm for the \(k\)-splittable maximum flow problem, Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem, Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem