default search action
Neil Olver
Person information
- affiliation: London School of Economics and Political Science, Department of Mathematics, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Daniel Dadush
, Zhuan Khye Koh
A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column. STOC 2024: 1561-1572 - [i18]Neil Olver, Leon Sering, Laura Vargas Koch:
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. CoRR abs/2402.04935 (2024) - 2023
- [j16]Neil Olver
A duality based 2-approximation algorithm for maximum agreement forest. Math. Program. 198(1): 811-853 (2023) - [c23]Nathan Klein
Thin Trees for Laminar Families. FOCS 2023: 50-59 - [c22]Neil Olver, Leon Sering
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time. FOCS 2023: 123-133 - [i17]Nathan Klein, Neil Olver:
Thin trees for laminar families. CoRR abs/2304.07674 (2023) - [i16]Aleksander Figiel, Janne H. Korhonen, Neil Olver, Stefan Schmid
Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding. CoRR abs/2308.10579 (2023) - 2022
- [j15]Roberto Cominetti
Long-Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. Oper. Res. 70(1): 516-526 (2022) - [j14]Dario Frascaria
Algorithms for flows over time with scheduling costs. Math. Program. 192(1): 177-206 (2022) - 2021
- [j13]Madelon A. de Kemp
Performance of the Smallest-Variance-First Rule in Appointment Sequencing. Oper. Res. 69(6): 1909-1935 (2021) - [j12]Coulter Beeson, Neil Olver:
A short proof of convexity of step-out-step-in sequencing games. Oper. Res. Lett. 49(2): 257-259 (2021) - [c21]Neil Olver, Leon Sering
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. FOCS 2021: 851-860 - [c20]Sander Borst
Majorizing Measures for the Optimizer. ITCS 2021: 73:1-73:20 - [i15]Neil Olver, Leon Sering, Laura Vargas Koch:
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. CoRR abs/2111.06877 (2021) - [i14]Coulter Beeson, Neil Olver:
A Short Proof of Convexity of Step-out Step-in Sequencing Games. CoRR abs/2112.10180 (2021) - [i13]Roberto Cominetti, José Correa, Neil Olver:
Long term behavior of dynamic equilibria in fluid queuing networks. CoRR abs/2112.10412 (2021) - 2020
- [j11]Neil Olver
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. J. ACM 67(2): 10:1-10:26 (2020) - [j10]André Linhares, Neil Olver, Chaitanya Swamy
Approximate multi-matroid intersection via iterative refinement. Math. Program. 183(1): 397-418 (2020) - [c19]Thomas Bosman, Neil Olver:
Improved Approximation Algorithms for Inventory Problems. IPCO 2020: 91-103 - [c18]Dario Frascaria, Neil Olver:
Algorithms for Flows over Time with Scheduling Costs. IPCO 2020: 130-143 - [i12]Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha:
Majorizing Measures for the Optimizer. CoRR abs/2012.13306 (2020)
2010 – 2019
- 2019
- [c17]Thomas Bosman, Dario Frascaria, Neil Olver, René Sitters, Leen Stougie:
Fixed-Order Scheduling on Parallel Machines. IPCO 2019: 88-100 - [c16]André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-matroid Intersection via Iterative Refinement. IPCO 2019: 299-312 - [i11]Dario Frascaria, Neil Olver:
Algorithms for flows over time with scheduling costs. CoRR abs/1912.00082 (2019) - [i10]Thomas Bosman, Neil Olver:
Improved Approximation Algorithms for Inventory Problems. CoRR abs/1912.00101 (2019) - 2018
- [j9]Neil Olver
Chain-constrained spanning trees. Math. Program. 167(2): 293-314 (2018) - [c15]Daniel Dadush, Cristóbal Guzmán
Fast, Deterministic and Sparse Dimensionality Reduction. SODA 2018: 1330-1344 - [c14]Neil Olver, Kirk Pruhs, Kevin Schewior, René Sitters, Leen Stougie:
The Itinerant List Update Problem. WAOA 2018: 310-326 - [i9]Neil Olver, Frans Schalekamp, Suzanne van der Ster, Leen Stougie, Anke van Zuylen:
A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. CoRR abs/1811.05916 (2018) - [i8]André Linhares, Neil Olver, Chaitanya Swamy, Rico Zenklusen:
Approximate Multi-Matroid Intersection via Iterative Refinement. CoRR abs/1811.09027 (2018) - [i7]Madelon A. de Kemp, Michel Mandjes, Neil Olver:
Performance of the smallest-variance-first rule in appointment sequencing. CoRR abs/1812.01467 (2018) - 2017
- [c13]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: 17:1-17:13 - [c12]Thomas Bosman, Neil Olver
Exploring the Tractability of the Capped Hose Model. ESA 2017: 19:1-19:12 - [c11]Roberto Cominetti
Long Term Behavior of Dynamic Equilibria in Fluid Queuing Networks. IPCO 2017: 161-172 - [c10]Neil Olver
A simpler and faster strongly polynomial algorithm for generalized flow maximization. STOC 2017: 100-111 - [i6]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 abs/1706.06565 (2017) - 2016
- [j8]Andreas Emil Feldmann
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Math. Program. 160(1-2): 379-406 (2016) - [j7]Neil Olver
A note on hierarchical hubbing for a generalization of the VPN problem. Oper. Res. Lett. 44(2): 191-195 (2016) - [i5]Neil Olver, László A. Végh:
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization. CoRR abs/1611.01778 (2016) - 2015
- [j6]Richard Cole, José R. Correa, Vasilis Gkatzelis
Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. 92: 306-326 (2015) - [c9]José Correa, Marcos A. Kiwi
Adaptive Rumor Spreading. WINE 2015: 272-285 - 2014
- [j5]Neil Olver
Approximability of Robust Network Design. Math. Oper. Res. 39(2): 561-572 (2014) - [c8]Andreas Emil Feldmann
On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. APPROX-RANDOM 2014: 176-191 - [c7]Nicholas J. A. Harvey, Neil Olver:
Pipage Rounding, Pessimistic Estimators and Matrix Concentration. SODA 2014: 926-945 - [i4]Neil Olver:
A note on hierarchical hubbing for a generalization of the VPN problem. CoRR abs/1406.7841 (2014) - 2013
- [j4]Navin Goyal, Neil Olver
The VPN Conjecture Is True. J. ACM 60(3): 17:1-17:17 (2013) - [c6]Neil Olver
Chain-Constrained Spanning Trees. IPCO 2013: 324-335 - [i3]Nicholas J. A. Harvey, Neil Olver:
Pipage Rounding, Pessimistic Estimators and Matrix Concentration. CoRR abs/1307.2274 (2013) - [i2]Navin Goyal, Neil Olver, F. Bruce Shepherd:
Dynamic vs Oblivious Routing in Network Design. CoRR abs/1309.4140 (2013) - 2012
- [c5]Michel X. Goemans, Neil Olver
Matroids and integrality gaps for hypergraphic steiner tree relaxations. STOC 2012: 1161-1176 - 2011
- [j3]Navin Goyal, Neil Olver
Dynamic vs. Oblivious Routing in Network Design. Algorithmica 61(1): 161-173 (2011) - [c4]Richard Cole, José R. Correa, Vasilis Gkatzelis
Inner product spaces for MinSum coordination mechanisms. STOC 2011: 539-548 - [i1]Michel X. Goemans, Neil Olver, Thomas Rothvoß, Rico Zenklusen:
Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations. CoRR abs/1111.7280 (2011) - 2010
- [c3]Neil Olver, F. Bruce Shepherd:
Approximability of Robust Network Design. SODA 2010: 1097-1105
2000 – 2009
- 2009
- [c2]Navin Goyal, Neil Olver
Dynamic vs. Oblivious Routing in Network Design. ESA 2009: 277-288 - 2008
- [j2]Babak Farzad, Neil Olver, Adrian Vetta:
A Priority-Based Model of Routing. Chic. J. Theor. Comput. Sci. 2008 (2008) - [c1]Navin Goyal, Neil Olver, F. Bruce Shepherd:
The vpn conjecture is true. STOC 2008: 443-450 - 2007
- [j1]Louigi Addario-Berry, Neil Olver
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games. J. Graph Algorithms Appl. 11(1): 309-319 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: