Neil Olver
Title
Cited by
Cited by
Year
The VPN conjecture is true
N Goyal, N Olver, FB Shepherd
Journal of the ACM (JACM) 60 (3), 1-17, 2013
552013
A priority-based model of routing
B Farzad, N Olver, A Vetta
Chicago Journal of Theoretical Computer Science 1, 2008
452008
Matroids and integrality gaps for hypergraphic Steiner tree relaxations
MX Goemans, N Olver, T Rothvoß, R Zenklusen
Proceedings of the forty-fourth annual ACM Symposium on Theory of Computing …, 2012
382012
Inner product spaces for minsum coordination mechanisms
R Cole, JR Correa, V Gkatzelis, V Mirrokni, N Olver
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
382011
Pipage rounding, pessimistic estimators and matrix concentration
NJA Harvey, N Olver
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
292014
Decentralized utilitarian mechanisms for scheduling games
R Cole, JR Correa, V Gkatzelis, V Mirrokni, N Olver
Games and Economic Behavior 92, 306-326, 2015
272015
Dynamic vs. oblivious routing in network design
N Goyal, N Olver, FB Shepherd
Algorithmica 61 (1), 161-173, 2011
252011
Spatial economics
P Koster, E Verhoef, N Olver, G van der Meijden, C Withagen, P Pelzl, ...
192019
On explosions in heavy-tailed branching random walks
O Amini, L Devroye, S Griffiths, N Olver
The Annals of Probability 41 (3B), 1864-1899, 2013
192013
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
L Addario-Berry, N Olver, A Vetta
J. Graph Algorithms Appl. 11 (1), 309-319, 2007
192007
Long term behavior of dynamic equilibria in fluid queuing networks
R Cominetti, J Correa, N Olver
International Conference on Integer Programming and Combinatorial …, 2017
162017
Robust network design
NK Olver
McGill University Library, 2010
162010
A simpler and faster strongly polynomial algorithm for generalized flow maximization
N Olver, LA Végh
Journal of the ACM (JACM) 67 (2), 1-26, 2020
132020
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
AE Feldmann, J Könemann, N Olver, L Sanitŕ
Mathematical programming 160 (1-2), 379-406, 2016
112016
Approximability of robust network design
N Olver, FB Shepherd
Mathematics of Operations Research 39 (2), 561-572, 2014
112014
The price of anarchy and a priority-based model of routing
N Olver
McGill University Libraries, 2006
102006
Explosion and linear transit times in infinite trees
O Amini, L Devroye, S Griffiths, N Olver
Probability Theory and Related Fields 167 (1-2), 325-347, 2017
62017
The itinerant list update problem
N Olver, K Pruhs, K Schewior, R Sitters, L Stougie
International Workshop on Approximation and Online Algorithms, 310-326, 2018
52018
Adaptive rumor spreading
J Correa, M Kiwi, N Olver, A Vera
International Conference on Web and Internet Economics, 272-285, 2015
52015
On the integrality gap of the prize-collecting Steiner forest LP
J Könemann, N Olver, K Pashkovich, R Ravi, C Swamy, J Vygen
arXiv preprint arXiv:1706.06565, 2017
32017
The system can't perform the operation now. Try again later.
Articles 1–20