Improved approximations for the minimum-cut ratio and the flux

DOI10.1007/BF01305312zbMath0844.68097MaRDI QIDQ4866679

Spyros Tragoudas

Publication date: 5 September 1996

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

A Mixed Integer Model for the Sparsest Cut problem ⋮ Improved bounds on the max-flow min-cut ratio for multicommodity flows ⋮ Designing multi-commodity flow trees

Cites Work

• Sparsest cuts and bottlenecks in graphs
• Multicommodity flows in planar graphs
• Fast approximation algorithms for multicommodity flow problems
• On Odd Cuts and Plane Multicommodity Flows
• Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
• Multi-Commodity Network Flows
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved approximations for the minimum-cut ratio and the flux