26 search results - page 6 / 6 » The maximum number of edges in a graph of bounded dimension,... |
FOCS
2009
IEEE
14 years 1 days ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...