A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows

DOI10.1137/S089548010138917XzbMath1144.90013OpenAlexW2041446334MaRDI QIDQ5454255

Oktay Günlük

Publication date: 28 March 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s089548010138917x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)

Related Items (6)

A Mixed Integer Model for the Sparsest Cut problem ⋮ An overview of graph covering and partitioning ⋮ Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem ⋮ Terminal embeddings ⋮ New algorithms for maximum disjoint paths based on tree-likeness ⋮ Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem

This page was built for publication: A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows