A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
type: Item
instance of: scholarly article
title: A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
zbMATH Open document ID: 1180.90345
author: Massimiliano Caramia
author: Antonino Sgalambro
published in: Optimization Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5664371
zbMATH Keywords: \(k\)-splittable flow
zbMATH Keywords: heuristic
zbMATH Keywords: maximum concurrent flow
zbMATH Keywords: multicommodity
zbMATH Keywords: throughput
MaRDI profile type: Publication
full work available at URL: s11590-009-0147-4
OpenAlex ID: W1966258309
cites work: Q3056948
cites work: Hardness of the undirected congestion minimization problem
cites work: Q4537731
cites work: Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
cites work: The \(k\)-splittable flow problem
cites work: An exact approach for the maximum concurrent \(k\)-splittable flow problem
cites work: On the approximation of the single source \(k\)-splittable flow problem
cites work: New hardness results for congestion minimization and machine scheduling
cites work: On the single-source unsplittable flow problem
cites work: The flow deviation method: An approach to store‐and‐forward communication network design
cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
cites work: A survey on multi-net global routing for integrated circuits
cites work: An overtraining-resistant stochastic modeling method for pattern recognition
cites work: Q4231910
cites work: Approximation and Online Algorithms
cites work: Minimum-cost single-source 2-splittable flow
cites work: Q4828931
cites work: Flows on few paths: Algorithms and lower bounds
cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs
cites work: Multiterminal global routing: A deterministic approximation scheme
cites work: The maximum concurrent flow problem
cites work: Approximating the single source unsplittable min-cost flow problem
cites work: Integer Programming and Combinatorial Optimization
DOI: 10.1007/S11590-009-0147-4
description: scientific article; zbMATH DE number 5664371