Neil Olver

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 40

Top Topics

Iterative Refinement

Integrality Gap

Strongly Polynomial

Top Venues

Publications

Neil Olver, Leon Sering, Laura Vargas Koch
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. CoRR (2024)
Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh
A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. STOC (2024)
Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid
Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding. CoRR (2023)
Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
A duality based 2-approximation algorithm for maximum agreement forest. Math. Program. 198 (1) (2023)
Nathan Klein, Neil Olver
Thin Trees for Laminar Families. FOCS (2023)
Neil Olver, Leon Sering, Laura Vargas Koch
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. FOCS (2023)
Nathan Klein, Neil Olver
Thin trees for laminar families. CoRR (2023)
Neil Olver, Leon Sering, Laura Vargas Koch
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. FOCS (2022)
Dario Frascaria, Neil Olver
Algorithms for flows over time with scheduling costs. Math. Program. 192 (1) (2022)
Roberto Cominetti, José R. Correa, Neil Olver
Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. Oper. Res. 70 (1) (2022)
Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
Majorizing Measures for the Optimizer. ITCS (2021)
Neil Olver, Leon Sering, Laura Vargas Koch
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. FOCS (2021)
Madelon A. de Kemp, Michel Mandjes, Neil Olver
Performance of the Smallest-Variance-First Rule in Appointment Sequencing. Oper. Res. 69 (6) (2021)
Roberto Cominetti, José R. Correa, Neil Olver
Long term behavior of dynamic equilibria in fluid queuing networks. CoRR (2021)
Neil Olver, Leon Sering, Laura Vargas Koch
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. CoRR (2021)
Coulter Beeson, Neil Olver
A short proof of convexity of step-out-step-in sequencing games. Oper. Res. Lett. 49 (2) (2021)
Coulter Beeson, Neil Olver
A Short Proof of Convexity of Step-out Step-in Sequencing Games. CoRR (2021)
Dario Frascaria, Neil Olver
Algorithms for Flows over Time with Scheduling Costs. IPCO (2020)
Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha
Majorizing Measures for the Optimizer. CoRR (2020)
Thomas Bosman, Neil Olver
Improved Approximation Algorithms for Inventory Problems. IPCO (2020)
Neil Olver, László A. Végh
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. J. ACM 67 (2) (2020)
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
Approximate multi-matroid intersection via iterative refinement. Math. Program. 183 (1) (2020)
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
Approximate Multi-matroid Intersection via Iterative Refinement. IPCO (2019)
Thomas Bosman, Neil Olver
Improved Approximation Algorithms for Inventory Problems. CoRR (2019)
Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie
Fixed-Order Scheduling on Parallel Machines. IPCO (2019)
Dario Frascaria, Neil Olver
Algorithms for flows over time with scheduling costs. CoRR (2019)
Daniel Dadush, Cristóbal Guzmán, Neil Olver
Fast, Deterministic and Sparse Dimensionality Reduction. SODA (2018)
Neil Olver, Rico Zenklusen
Chain-constrained spanning trees. Math. Program. 167 (2) (2018)
Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. CoRR (2018)
André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen
Approximate Multi-Matroid Intersection via Iterative Refinement. CoRR (2018)
Madelon A. de Kemp, Michel Mandjes, Neil Olver
Performance of the smallest-variance-first rule in appointment sequencing. CoRR (2018)
Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie
The Itinerant List Update Problem. WAOA (2018)
Neil Olver, László A. Végh
A simpler and faster strongly polynomial algorithm for generalized flow maximization. STOC (2017)
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM (2017)
Thomas Bosman, Neil Olver
Exploring the Tractability of the Capped Hose Model. ESA (2017)
Roberto Cominetti, José R. Correa, Neil Olver
Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. IPCO (2017)
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR (2017)
Neil Olver
A note on hierarchical hubbing for a generalization of the VPN problem. Oper. Res. Lett. 44 (2) (2016)
Neil Olver, László A. Végh
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. CoRR (2016)
Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Math. Program. 160 (1-2) (2016)
José R. Correa, Marcos A. Kiwi, Neil Olver, Alberto Vera
Adaptive Rumor Spreading. WINE (2015)
Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver
Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. 92 (2015)
Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. APPROX-RANDOM (2014)
Nicholas J. A. Harvey, Neil Olver
Pipage Rounding, Pessimistic Estimators and Matrix Concentration. SODA (2014)
Neil Olver
A note on hierarchical hubbing for a generalization of the VPN problem. CoRR (2014)
Neil Olver, F. Bruce Shepherd
Approximability of Robust Network Design. Math. Oper. Res. 39 (2) (2014)
Navin Goyal, Neil Olver, F. Bruce Shepherd
Dynamic vs Oblivious Routing in Network Design. CoRR (2013)
Neil Olver, Rico Zenklusen
Chain-Constrained Spanning Trees. IPCO (2013)
Nicholas J. A. Harvey, Neil Olver
Pipage Rounding, Pessimistic Estimators and Matrix Concentration. CoRR (2013)
Navin Goyal, Neil Olver, F. Bruce Shepherd
The VPN Conjecture Is True. J. ACM 60 (3) (2013)
Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen
Matroids and integrality gaps for hypergraphic steiner tree relaxations. STOC (2012)
Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen
Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations CoRR (2011)
Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver
Inner product spaces for MinSum coordination mechanisms. STOC (2011)
Navin Goyal, Neil Olver, F. Bruce Shepherd
Dynamic vs. Oblivious Routing in Network Design. Algorithmica 61 (1) (2011)
Neil Olver, F. Bruce Shepherd
Approximability of Robust Network Design. SODA (2010)
Navin Goyal, Neil Olver, F. Bruce Shepherd
Dynamic vs. Oblivious Routing in Network Design. ESA (2009)
Navin Goyal, Neil Olver, F. Bruce Shepherd
The vpn conjecture is true. STOC (2008)
Babak Farzad, Neil Olver, Adrian Vetta
A Priority-Based Model of Routing. Chic. J. Theor. Comput. Sci. 2008 (2008)
Louigi Addario-Berry, Neil Olver, Adrian Vetta
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. J. Graph Algorithms Appl. 11 (1) (2007)