Neil Olver

Könemann, J, Olver, N.K, Pashkovich, K, Ravi, R, Swamy, C, & Vygen, J. (2017). On the integrality gap of the prize-collecting Steiner forest LP. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.APPROX-RANDOM.2017.17

Cominetti, R, Correa, J, & Olver, N.K. (2017). Long term behavior of dynamic equilibria in fluid queuing networks. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-319-59250-3_14

Olver, N.K, & Végh, L.A. (2017). A simpler and faster strongly polynomial algorithm for generalized flow maximization. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 100–111). doi:10.1145/3055399.3055439

Feldmann, A.E, Könemann, J, Olver, N.K, & Sanità, L. (2016). On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Mathematical Programming, 160(1-2), 379–406. doi:10.1007/s10107-016-0987-5

Olver, N.K. (2016). A note on hierarchical hubbing for a generalization of the VPN problem. Operations Research Letters, 44(2), 191–195. doi:10.1016/j.orl.2015.12.020

Amini, O, Devroye, L, Griffiths, S, & Olver, N.K. (2014). Explosion and linear transit times in infinite trees. arXiv.org e-Print archive. Cornell University Library .

Feldmann, A.E, Könemann, J, Olver, N.K, & Sanità, L. (2014). On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. In N.R Devanur, C Moore, K Jansen, & J Rolim (Eds.), Dagstuhl Research Online Publication Server (Vol. 28, pp. 176–191). Schloss Dagstuhl. doi:10.4230/LIPIcs.APPROX-RANDOM.2014.176

Olver, N.K. (2014). A note on hierarchical hubbing for a generalization of the VPN problem. arXiv.org e-Print archive. Cornell University Library.

Harvey, N.J.A, & Olver, N.K. (2014). Pipage Rounding, Pessimistic Estimators and Matrix Concentration. In C Chekuri (Ed.), Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM.