Approximation and Online Algorithms
From MaRDI portal
Publication:5898477
DOI10.1007/11671411zbMath1177.90393OpenAlexW4210634114MaRDI QIDQ5898477
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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem ⋮ A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ Complexity and approximability of \(k\)-splittable flows ⋮ 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 ⋮ 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
This page was built for publication: Approximation and Online Algorithms
