An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
type: Item
instance of: scholarly article
title: An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
zbMATH Open document ID: 0837.68045
DOI: 10.1007/BF01200755
author: Ajit Agrawal
author: R. Ravi
author: Philip N. Klein
author: Satish Rao
published in: Combinatorica
publication date: 1996-04-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C08
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 778333
zbMATH Keywords: undirected multicommodity flow
zbMATH Keywords: multiway-cut problem
MaRDI profile type: Publication
cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
cites work: A graph-theoretic via minimization algorithm for two-layer printed circuit boards
cites work: Graph Bipartization and via minimization
cites work: Tough graphs and Hamiltonian circuits.
cites work: Q3292914
cites work: Q3972951
cites work: Approximate max-flow min-(multi)cut theorems and their applications
cites work: Q4198056
cites work: Multi-Commodity Network Flows
cites work: Approximation algorithms for combinatorial problems
cites work: New problems complete for nondeterministic log space
cites work: Excluded minors, network decomposition, and multicommodity flow
cites work: Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts
cites work: Q3775485
cites work: Q3346242
cites work: A Heuristic Algorithm for Small Separators in Arbitrary Graphs
cites work: Improved bounds on the max-flow min-cut ratio for multicommodity flows
cites work: The maximum concurrent flow problem
cites work: Edge-Deletion Problems
full work available at URL: https://doi.org/10.1007/bf01200755
OpenAlex ID: W1992520677
description: scientific article; zbMATH DE number 778333