Neil Olver

Orcid: 0000-0001-8897-5459

Affiliations:
  • London School of Economics and Political Science, Department of Mathematics, UK


According to our database1, Neil Olver authored at least 31 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A duality based 2-approximation algorithm for maximum agreement forest.
Math. Program., March, 2023

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

Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Thin Trees for Laminar Families.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Algorithms for flows over time with scheduling costs.
Math. Program., 2022

Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks.
Oper. Res., 2022

2021
A short proof of convexity of step-out-step-in sequencing games.
Oper. Res. Lett., 2021

Performance of the Smallest-Variance-First Rule in Appointment Sequencing.
Oper. Res., 2021

Majorizing Measures for the Optimizer.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Approximate multi-matroid intersection via iterative refinement.
Math. Program., 2020

A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization.
J. ACM, 2020

Improved Approximation Algorithms for Inventory Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2019
Fixed-Order Scheduling on Parallel Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
Chain-constrained spanning trees.
Math. Program., 2018

The Itinerant List Update Problem.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Fast, Deterministic and Sparse Dimensionality Reduction.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Exploring the Tractability of the Capped Hose Model.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

On the Integrality Gap of the Prize-Collecting Steiner Forest LP.
Proceedings of the Approximation, 2017

2016
A note on hierarchical hubbing for a generalization of the VPN problem.
Oper. Res. Lett., 2016

On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree.
Math. Program., 2016

2015
Decentralized utilitarian mechanisms for scheduling games.
Games Econ. Behav., 2015

Adaptive Rumor Spreading.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2014
Approximability of Robust Network Design.
Math. Oper. Res., 2014

Pipage Rounding, Pessimistic Estimators and Matrix Concentration.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
The VPN Conjecture Is True.
J. ACM, 2013

2012
Matroids and integrality gaps for hypergraphic steiner tree relaxations.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

2011
Dynamic vs. Oblivious Routing in Network Design.
Algorithmica, 2011

Inner product spaces for MinSum coordination mechanisms.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2008
A Priority-Based Model of Routing.
Chic. J. Theor. Comput. Sci., 2008

2007
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games.
J. Graph Algorithms Appl., 2007


  Loading...