A combinatorial approximation algorithm for concurrent flow problem and its application

DOI10.1016/J.COR.2003.09.010zbMATH Open1071.90036OpenAlexW1989177948MaRDI QIDQ707017FDOQ707017

Suh-Wen Chiou

Publication date: 9 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.09.010

zbMATH Keywords

Combinatorial algorithmConcurrent flow problemMinimum-cost flow

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding Minimum-Cost Circulations by Successive Approximation
• The maximum concurrent flow problem
• Using separation algorithms in fixed dimension
• Optimization of area traffic control for equilibrium network flows
• A natural randomization strategy for multicommodity flow and related algorithms
• Fast deterministic approximation for the multicommodity flow problem
• Fast approximation algorithms for multicommodity flow problems
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

Cited In (7)

• Combinatorial approximation algorithms for generalized flow problems
• Bounds on maximum concurrent flow in random bipartite graphs
• Combinatorial approaches to multiflow problems
• Title not available (Why is that?)
• Approximation Algorithms for the Maximum Concurrent Flow Problem
• Meet and merge: approximation algorithms for confluent flows
• Efficient algorithms for the maximum concurrent flow problem

Uses Software

• LEDA
• CPLEX

   Recommendations

• Approximation Algorithms for the Maximum Concurrent Flow Problem 👍 👎
• Combinatorial approximation algorithms for generalized flow problems 👍 👎
• Approximation algorithms and hardness of integral concurrent flow 👍 👎
• An exact approach for the maximum concurrent \(k\)-splittable flow problem 👍 👎
• Efficient algorithms for the maximum concurrent flow problem 👍 👎
• Approximation and Online Algorithms 👍 👎
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem 👍 👎
• Title not available (Why is that?) 👍 👎
• Approximation algorithms for the parallel flow shop problem 👍 👎

This page was built for publication: A combinatorial approximation algorithm for concurrent flow problem and its application

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