Author:
Korte Bernhard,Vygen Jens
Publisher
Springer Berlin Heidelberg
Reference57 articles.
1. Aumann, Y. und Rabani, Y.: An
Aumann, Y.
Rabani, Y.
$O(\log k)$
approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing 27, 291–301 (1998)
2. Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning. Journal of the ACM
Arora, S.
Rao, S.
Vazirani, U.V.
56, Article 5 (2009)
3. Arora, S., Hazan, E., Kale, S.:
Arora, S.
Hazan, E.
Kale, S.
$O(\sqrt{\log n})$
approximation to Sparsest Cut in
$\tilde{O}(n^{2})$
time, S. 238–247. Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (2004)
4. Becker, M., Mehlhorn, K.: Algorithms for routing in planar graphs. Acta Informatica
Becker, M.
Mehlhorn, K.
23, 163–176 (1986)
5. Bienstock, D., Iyengar, G.: Solving fractional packing problems in
Bienstock, D.
Iyengar, G.
$O^{*}(\frac{1}{\epsilon})$
iterations. SIAM Journal on Computing 35, 825–854 (2006)