Pages that link to "Item:Q818146"

The following pages link to On the Max-flow min-cut ratio for directed multicommodity flows (Q818146):

Displaying 3 items.

• On the hardness of finding near-optimal multicuts in directed acyclic graphs (Q719273) (← links)
• On the complexity of the multicut problem in bounded tree-width graphs and digraphs (Q944745) (← links)
• An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)