OREGON STATE UNIVERSITY

You are here

Biblio

Found 5 results
Filters: Author is Klein, Philip N.  [Clear All Filters]
2011
Borradaile, G., P. N. Klein, S. Mozes, Y. Nussbaum, and C. Wulff-Nilsen, "Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time", 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), Palm Springs, CA, IEEE, pp. 170 - 179, 10.2011.
2009
Borradaile, G., and P. N. Klein, "An O(n log n) Algorithm for Maximum St-Flow in a Directed Planar Graph", Journal of the ACM, vol. 56, issue 2, pp. 1 - 30, 04/2009.
Borradaile, G., P. N. Klein, and C. Mathieu, "A Polynomial-Time Approximation Scheme for Steiner Tree in Planar Graphs", ACM Transactions on Algorithms, vol. 5, issue 3, pp. 1 - 31, 07/2009.
2008
Borradaile, G., and P. N. Klein, Lecture Notes in Computer ScienceAutomata, Languages and ProgrammingThe Two-Edge Connectivity Survivable Network Problem in Planar Graphs, , vol. 5125, Berlin, Heidelberg, Springer Berlin Heidelberg, pp. 485 - 501, 2008.
Borradaile, G., P. N. Klein, and C. Mathieu, "A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest", 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Philadelphia, PA, IEEE, pp. 115 - 124, 10/2008.