Pages that link to "Item:Q1900189"

The following pages link to Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189):

Displaying 12 items.

• Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network (Q320688) (← links)
• Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs (Q685479) (← links)
• On the Max-flow min-cut ratio for directed multicommodity flows (Q818146) (← links)
• Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
• An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701) (← links)
• Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558) (← links)
• Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
• On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths (Q3388417) (← links)
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications (Q4877516) (← links)
• Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
• A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows (Q5454255) (← links)