Neil Olver

According to our database, Neil Olver authored at least 34 papers between 2007 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

A Strongly Polynomial Algorithm for Linear Programs with at Most Two Non-Zero Entries per Row or Column (Invited Talk).

Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column.

Daniel Dadush, Zhuan Khye Koh, Bento Natura, Neil Olver, László A. Végh

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Efficient Algorithms for Demand-Aware Networks and a Connection to Virtual Network Embedding.

Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid

Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024

2023

A duality based 2-approximation algorithm for maximum agreement forest.

Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen

Math. Program., March, 2023

Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding.

Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid

CoRR, 2023

Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time.

Neil Olver, Leon Sering, Laura Vargas Koch

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Thin Trees for Laminar Families.

Nathan Klein, Neil Olver

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2021

A short proof of convexity of step-out-step-in sequencing games.

Coulter Beeson, Neil Olver

Oper. Res. Lett., 2021

Performance of the Smallest-Variance-First Rule in Appointment Sequencing.

Madelon A. de Kemp, Michel Mandjes, Neil Olver

Oper. Res., 2021

Majorizing Measures for the Optimizer.

Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time.

Neil Olver, Leon Sering, Laura Vargas Koch

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Algorithms for Flows over Time with Scheduling Costs.

Dario Frascaria, Neil Olver

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Improved Approximation Algorithms for Inventory Problems.

Thomas Bosman, Neil Olver

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019

Approximate Multi-matroid Intersection via Iterative Refinement.

André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

Fixed-Order Scheduling on Parallel Machines.

Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

The Itinerant List Update Problem.

Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Fast, Deterministic and Sparse Dimensionality Reduction.

Daniel Dadush, Cristóbal Guzmán, Neil Olver

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017

A simpler and faster strongly polynomial algorithm for generalized flow maximization.

Neil Olver, László A. Végh

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks.

Roberto Cominetti, José Correa, Neil Olver

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Exploring the Tractability of the Capped Hose Model.

Thomas Bosman, Neil Olver

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

On the Integrality Gap of the Prize-Collecting Steiner Forest LP.

Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen

Proceedings of the Approximation, 2017

2016

A note on hierarchical hubbing for a generalization of the VPN problem.

Neil Olver

Oper. Res. Lett., 2016

2015

Decentralized utilitarian mechanisms for scheduling games.

Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver

Games Econ. Behav., 2015

Adaptive Rumor Spreading.

José Correa, Marcos A. Kiwi, Neil Olver, Alberto Vera

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2014

Pipage Rounding, Pessimistic Estimators and Matrix Concentration.

Nicholas J. A. Harvey, Neil Olver

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree.

Andreas Emil Feldmann, Jochen Könemann, Neil Olver, Laura Sanità

Proceedings of the Approximation, 2014

2013

Chain-Constrained Spanning Trees.

Neil Olver, Rico Zenklusen

Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012

Matroids and integrality gaps for hypergraphic steiner tree relaxations.

Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011

Inner product spaces for MinSum coordination mechanisms.

Richard Cole, José R. Correa, Vasilis Gkatzelis, Vahab S. Mirrokni, Neil Olver

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010

Approximability of Robust Network Design.

Neil Olver, F. Bruce Shepherd

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Dynamic vs. Oblivious Routing in Network Design.

Navin Goyal, Neil Olver, F. Bruce Shepherd

Proceedings of the Algorithms, 2009

2008

A Priority-Based Model of Routing.

Babak Farzad, Neil Olver, Adrian Vetta

Chic. J. Theor. Comput. Sci., 2008

The vpn conjecture is true.

Navin Goyal, Neil Olver, F. Bruce Shepherd

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2007

A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games.

Louigi Addario-Berry, Neil Olver, Adrian Vetta

J. Graph Algorithms Appl., 2007