Seguir
Neil Olver
Título
Citado por
Citado por
Año
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
712012
The VPN conjecture is true
N Goyal, N Olver, FB Shepherd
Journal of the ACM (JACM) 60 (3), 1-17, 2013
602013
Decentralized utilitarian mechanisms for scheduling games
R Cole, JR Correa, V Gkatzelis, V Mirrokni, N Olver
Games and Economic Behavior 92, 306-326, 2015
532015
A priority-based model of routing
B Farzad, N Olver, A Vetta
Chicago Journal of Theoretical Computer Science 1, 2008
502008
Pipage rounding, pessimistic estimators and matrix concentration
NJA Harvey, N Olver
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
492014
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
462011
Long-term behavior of dynamic equilibria in fluid queuing networks
R Cominetti, J Correa, N Olver
Operations Research 70 (1), 516-526, 2022
412022
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
332020
Dynamic vs. oblivious routing in network design
N Goyal, N Olver, F Bruce Shepherd
Algorithmica 61, 161-173, 2011
282011
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
252007
On explosions in heavy-tailed branching random walks
O Amini, L Devroye, S Griffiths, N Olver
242013
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
AE Feldmann, J Könemann, N Olver, L Sanità
Mathematical programming 160, 379-406, 2016
212016
Robust network design
N Olver
McGill University, 2010
202010
Explosion and linear transit times in infinite trees
O Amini, L Devroye, S Griffiths, N Olver
Probability Theory and Related Fields 167, 325-347, 2017
172017
Approximate multi-matroid intersection via iterative refinement
A Linhares, N Olver, C Swamy, R Zenklusen
Integer Programming and Combinatorial Optimization: 20th International …, 2019
162019
Performance of the smallest-variance-first rule in appointment sequencing
MA De Kemp, M Mandjes, N Olver
Operations Research 69 (6), 1909-1935, 2021
152021
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
152018
Approximability of robust network design
N Olver, FB Shepherd
Mathematics of Operations Research 39 (2), 561-572, 2014
122014
The price of anarchy and a priority-based model of routing
N Olver
McGill University, 2006
122006
Continuity, uniqueness and long-term behavior of Nash flows over time
N Olver, L Sering, LV Koch
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
92022
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20