Pages that link to "Item:Q1894701"
From MaRDI portal
The following pages link to An approximate max-flow min-cut relation for undirected multicommodity flow, with applications (Q1894701):
Displayed 5 items.
- Approximation algorithms for requirement cut on graphs (Q848961) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations (Q1598763) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)