scientific article; zbMATH DE number 515935

MaRDI QIDQ4283450zbMATH OpenFDO

Authors Taekyung S. Kang, James Borger, Philip N. Klein

Publication date 23 June 1994

zbMATH Keywords

concurrent flow approximation algorithmrandomized path selection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Programming involving graphs or networks (90C35)

Recommendations

• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
• Improved approximations for the minimum-cut ratio and the flux
• Approximation Algorithms for the Maximum Concurrent Flow Problem
• Fast approximation algorithms for multicommodity flow problems
• Fast deterministic approximation for the multicommodity flow problem

Cited in

(1)

• Source sink flows with capacity installation in batches

This page was built for publication:

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