Approximation and Online Algorithms

DOI10.1007/11671411zbMATH Open1177.90393OpenAlexW4210634114MaRDI QIDQ5898477FDOQ5898477

Authors: Ronald Koch, Ines Spenke, Martin Skutella 

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

Recommendations

• Maximum \(k\)-splittable \(s, t\)-flows
• Complexity and approximability of \(k\)-splittable flows
• The \(k\)-splittable flow problem
• scientific article; zbMATH DE number 1947385
• A polynomial time approximation algorithm for the two-commodity splittable flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited In (13)

• Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem
• Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem
• Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem
• The \(k\)-splittable flow problem
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
• An exact approach for the maximum concurrent \(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
• A polynomial time approximation algorithm for the two-commodity splittable flow problem
• Title not available (Why is that?)
• Complexity and approximability of \(k\)-splittable flows
• Maximum \(k\)-splittable \(s, t\)-flows
• On the approximation of the single source \(k\)-splittable flow problem

This page was built for publication: Approximation and Online Algorithms

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