Approximation Algorithms for the Maximum Concurrent Flow Problem

DOI10.1287/IJOC.1.2.62zbMATH Open0753.90030OpenAlexW2159872727MaRDI QIDQ4019972FDOQ4019972

Authors: Farhad Shahrokhi 

Publication date: 16 January 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1.2.62

Recommendations

• Efficient algorithms for the maximum concurrent flow problem
• A combinatorial approximation algorithm for concurrent flow problem and its application
• Algorithms and complexity for the almost equal maximum flow problem
• The maximum concurrent flow problem
• Approximation algorithms and hardness of integral concurrent flow
• An exact approach for the maximum concurrent \(k\)-splittable flow problem
• Polynomial-time algorithms for special cases of the maximum confluent flow problem
• Approximation algorithm for maximum flow network interdiction problem
• A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem

zbMATH Keywords

multicommodity flowsmaximum concurrent flow problemfully polynomial \(\varepsilon\)-approximate algorithmlinear size reduction

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (19)

• A maximum multicommodity flow problem with global fair met rate
• Title not available (Why is that?)
• Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
• Capacitated Confluent Flows: Complexity and Algorithms
• Combinatorial approximation algorithms for generalized flow problems
• Approximation algorithms and hardness of integral concurrent flow
• Title not available (Why is that?)
• A combinatorial approximation algorithm for concurrent flow problem and its application
• An exponential‐function reduction method for block‐angular convex programs
• Max concurrent flow problem
• On Canonical Concurrent Flows, Crossing Number and Graph Expansion
• Maximum concurrent flow with incomplete data
• Algorithms and complexity for the almost equal maximum flow problem
• Using the minimum maximum flow degree to approximate the flow coloring problem
• Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
• Meet and merge: approximation algorithms for confluent flows
• The maximum concurrent flow problem
• Efficient algorithms for the maximum concurrent flow problem

This page was built for publication: Approximation Algorithms for the Maximum Concurrent Flow Problem

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