Pages that link to "Item:Q1894701"

The following pages link to An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701):

Displaying 16 items.

• Approximation algorithms for requirement cut on graphs (Q848961) (← links)
• The multi-multiway cut problem (Q884458) (← links)
• An improved approximation algorithm for requirement cut (Q991474) (← links)
• Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
• Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
• Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
• A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (Q2164684) (← links)
• Approximating the fixed linear crossing number (Q2456999) (← links)
• Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
• Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
• (Q5020877) (← links)
• Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
• Approximating Requirement Cut via a Configuration LP (Q6084417) (← links)
• A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time (Q6589758) (← links)
• Max-flow min-cut theorem in quantum computing (Q6593548) (← links)
• Stochastic embeddings of graphs into trees (Q6613290) (← links)