Seuraa
Neil Olver
Nimike
Viittaukset
Viittaukset
Vuosi
The VPN conjecture is true
N Goyal, N Olver, FB Shepherd
Journal of the ACM (JACM) 60 (3), 1-17, 2013
612013
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
602012
A priority-based model of routing
B Farzad, N Olver, A Vetta
Chicago Journal of Theoretical Computer Science 1, 2008
482008
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
422011
Decentralized utilitarian mechanisms for scheduling games
R Cole, JR Correa, V Gkatzelis, V Mirrokni, N Olver
Games and Economic Behavior 92, 306-326, 2015
412015
Pipage rounding, pessimistic estimators and matrix concentration
NJA Harvey, N Olver
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
352014
Long-term behavior of dynamic equilibria in fluid queuing networks
R Cominetti, J Correa, N Olver
Operations Research 70 (1), 516-526, 2022
332022
Dynamic vs. oblivious routing in network design
N Goyal, N Olver, F Bruce Shepherd
Algorithmica 61 (1), 161-173, 2011
282011
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
252020
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
222007
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
202013
Robust network design
N Olver
192010
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), 379-406, 2016
152016
Approximability of robust network design
N Olver, FB Shepherd
Mathematics of Operations Research 39 (2), 561-572, 2014
132014
The price of anarchy and a priority-based model of routing
N Olver
132006
Explosion and linear transit times in infinite trees
O Amini, L Devroye, S Griffiths, N Olver
Probability Theory and Related Fields 167 (1), 325-347, 2017
122017
Algorithms for flows over time with scheduling costs
D Frascaria, N Olver
Mathematical Programming 192 (1), 177-206, 2022
72022
Approximate multi-matroid intersection via iterative refinement
A Linhares, N Olver, C Swamy, R Zenklusen
International Conference on Integer Programming and Combinatorial …, 2019
72019
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
72018
Adaptive rumor spreading
J Correa, M Kiwi, N Olver, A Vera
International Conference on Web and Internet Economics, 272-285, 2015
62015
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20