Items where Author is "Olver, Neil"

Olver, Neil ORCID: 0000-0001-8897-5459 (2024) Favourite open problems: Prof. Benny Sudakov. Maths at LSE (21 Jun 2024). Blog Entry.

Dadush, Daniel, Koh, Zhuan Khye, Natura, Bento, Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2024) A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. In: Mohar, Bojan, Shinkar, Igor and O�Donnell, Ryan, (eds.) STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC ’24), June 24–28. Proceedings of the Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY, 1561 – 1572. ISBN 9798400703836

Olver, Neil ORCID: 0000-0001-8897-5459, Sering, Leon and Vargas Koch, Laura (2023) Convergence of approximate and packet routing equilibria to Nash flows over time. In: Proceedings of the 64th IEEE Symposium on Foundations of Computer Science (FOCS. Annual IEEE Symposium on Foundations of Computer Science,64. IEEE Computer Society Press, 123 - 133. ISBN 9798350318951

Klein, Nathan and Olver, Neil ORCID: 0000-0001-8897-5459 (2023) Thin trees for laminar families. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science: FOCS 2023, Proceedings. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society Press. ISBN 9798350318951

Olver, Neil ORCID: 0000-0001-8897-5459, Schalekamp, Frans, van der Ster, Suzanne, Stougie, Leen and van Zuylen, Anke (2023) A duality based 2-approximation algorithm for maximum agreement forest. Mathematical Programming, 198 (1). 811 - 853. ISSN 0025-5610

Olver, Neil ORCID: 0000-0001-8897-5459, Sering, Leon and Vargas Koch, Laura (2022) Continuity, uniqueness and long-term behavior of Nash flows over time. In: IEEE Symposium on Foundations of Computer Science (FOCS) 2022. IEEE Press.

Frascaria, Dario and Olver, Neil ORCID: 0000-0001-8897-5459 (2022) Algorithms for flows over time with scheduling costs. Mathematical Programming: A Publication of the Mathematical Optimization Society, 192 (1-2). 177 - 206. ISSN 0025-5610

Cominetti, Roberto, Correa, José and Olver, Neil ORCID: 0000-0001-8897-5459 (2022) Long-term behavior of dynamic equilibria in fluid queuing networks. Operations Research, 70 (1). 516 - 526. ISSN 0030-364X

de Kemp, Madelon A, Mandjes, Michel and Olver, Neil ORCID: 0000-0001-8897-5459 (2021) Performance of the smallest-variance-first rule in appointment sequencing. Operations Research, 69 (6). 1909 - 1935. ISSN 0030-364X

Beeson, Coulter and Olver, Neil ORCID: 0000-0001-8897-5459 (2021) A short proof of convexity of step-out–step-in sequencing games. Operations Research Letters, 49 (2). 257 - 259. ISSN 0167-6377

Borst, Sander, Dadush, Daniel, Olver, Neil ORCID: 0000-0001-8897-5459 and Sinha, Makrand (2021) Majorizing measures for the optimizer. In: Lee, James R., (ed.) 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. ISBN 9783959771771

Linhares, André, Olver, Neil ORCID: 0000-0001-8897-5459, Swamy, Chaitanya and Zenklusen, Rico (2020) Approximate multi-matroid intersection via iterative refinement. Mathematical Programming: A Publication of the Mathematical Optimization Society, 183 (1-2). 397 - 418. ISSN 0025-5610

Frascaria, Dario, Olver, Neil ORCID: 0000-0001-8897-5459 and Verhoef, Erik (2020) Emergent hypercongestion in Vickrey bottleneck networks. Transportation Research Part B: Methodological, 139. 523 - 538. ISSN 0191-2615

Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2020) A simpler and faster strongly polynomial algorithm for generalized flow maximization. Journal of the ACM, 67 (2). ISSN 0004-5411

Frascaria, Dario and Olver, Neil ORCID: 0000-0001-8897-5459 (2020) Algorithms for flows over time with scheduling costs. In: Bienstock, Daniel and Zambelli, Giacomo, (eds.) Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Berlin / Heidelberg, GBR, 130 - 143. ISBN 9783030457709

Bosman, Thomas and Olver, Neil ORCID: 0000-0001-8897-5459 (2020) Improved approximation algorithms for inventory problems. In: Bienstock, Daniel and Zambelli, Giacomo, (eds.) Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Berlin / Heidelberg, GBR, 91 - 103. ISBN 9783030457709

Linhares, Andre, Olver, Neil ORCID: 0000-0001-8897-5459, Swamy, Chaitanya and Zenklusen, Rico (2019) Approximate multi-matroid intersection via iterative refinement. In: Lodi, Andrea and Nagarajan, Viswanath, (eds.) Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),11480. Springer Berlin / Heidelberg, Cham, CHE, 299 - 312. ISBN 9783030179526

Bosman, Thomas, Frascaria, Dario, Olver, Neil ORCID: 0000-0001-8897-5459, Sitters, Rene and Stougie, Leen (2019) Fixed-order scheduling on parallel machines. In: Lodi, Andrea and Nagarajan, Viswanath, (eds.) Integer Programming and Combinatorial Optimization: 20th International Conference, IPCO 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),11480. Springer Berlin / Heidelberg, Cham, CHE, 88 - 100. ISBN 9783030179526

Olver, Neil ORCID: 0000-0001-8897-5459, Pruhs, Kirk, Schewior, Kevin, Sitters, Rene and Stougie, Leen (2018) The itinerant list update problem. In: Epstein, L and Erlebach, T, (eds.) Approximation and Online Algorithms: WAOA 2018. Lecture Notes in Computer Science,11312. Springer Berlin / Heidelberg, FIN, pp. 310-326. ISBN 9783030046927

Dadush, Daniel, Guzmán, Cristóbal and Olver, Neil ORCID: 0000-0001-8897-5459 (2018) Fast, deterministic and sparse dimensionality reduction. In: ACM SIAM Symposium on Discrete Algorithms, 2018-01-07 - 2018-01-10, Astor Crowne Plaza, New Orleans, United States, USA.

Bosman, Thomas and Olver, Neil ORCID: 0000-0001-8897-5459 (2017) Exploring the tractability of the capped hose model. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA): ALGO 2017, 2018-09-04 - 2018-09-08, Vienna, Vienns, Austria, AUT.

Könemann, Jochen, Olver, Neil ORCID: 0000-0001-8897-5459, Pashkovich, Kanstantsin, Ravi, R, Swamy, Chaitanya and Vygen, Jens (2017) On the integrality gap of the prize-collecting steiner forest LP. In: Approx 2017 - Random 2017, 2017-08-16 - 2017-08-18, UC Berkley, Berkley, United States, USA.

Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2017) A simpler and faster strongly polynomial algorithm for generalized flow maximization. In: STOC: ACM Symposium on Theory of Computing. ACM Press, 100 - 111. ISBN 9781450345286

Cominetti, Roberto, Correa, Jose and Olver, Neil ORCID: 0000-0001-8897-5459 (2017) Long term behavior of dynamic equilibria in fluid queuing networks. In: IPCO: International Conference on Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. Springer Berlin / Heidelberg, CAN, pp. 161-172.

Olver, Neil ORCID: 0000-0001-8897-5459 and Végh, László A. ORCID: 0000-0003-1152-200X (2017) A simpler and faster strongly polynomial algorithm for generalized flow maximization. In: STOC 2017 Theory Fest: 49th Annual ACM Symposium on the Theory of Computing, 2017-06-19 - 2017-06-23, Hyatt Regency, Montreal, Montreal, Canada, CAN.

Olver, Neil ORCID: 0000-0001-8897-5459 and Zenklusen, Rico (2017) Chain-constrained spanning trees. Mathematical Programming, 167 (2). 293 - 314. ISSN 0025-5610

Feldmann, Andreas Emil, Könemann, Jochen, Olver, Neil ORCID: 0000-0001-8897-5459 and Sanitàa, Laura (2016) On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Mathematical Programming, 160 (1-2). 379 - 406. ISSN 0025-5610

Olver, Neil ORCID: 0000-0001-8897-5459 (2016) A note on hierarchical hubbing for a generalization of the VPN problem. Operations Research Letters, 44 (2). 191 - 195. ISSN 0167-6377

Amini, Omid, Devroye, Luc, Griffiths, Simon and Olver, Neil ORCID: 0000-0001-8897-5459 (2015) Explosion and linear transit times in infinite trees. Probability Theory and Related Fields, 167. 325 - 347. ISSN 0178-8051

Correa, Jose, Kiwi, Marcos, Olver, Neil ORCID: 0000-0001-8897-5459 and Vera, Alberto (2015) Adaptive Rumor Spreading. In: WINE 2015: the 11th conference on web and internet economics, 2015-12-09 - 2015-12-12, Amsterdam, Amsterdam, Netherlands, NLD.

Cole, Richard, Correa, Jose, Gkatzelis, Vasillis, Mirrokni, Vahab and Olver, Neil ORCID: 0000-0001-8897-5459 (2015) Decentralized utilitarian mechanisms for scheduling games. Games and Economic Behavior, 92. 306 - 326. ISSN 0899-8256

Feldmann, Andreas Emil, Könemann, Jochen, Olver, Neil ORCID: 0000-0001-8897-5459 and Sanitàa, Laura (2014) On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. In: 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Random-Approx 2014, 2014-09-04 - 2014-09-06, Universitat Politècnica de Catalunya (UPC), Barcelona, Spain, ESP.

Olver, Neil ORCID: 0000-0001-8897-5459 and Zenklusen, Rico (2014) Chain-constrained spanning trees. In: The 16th Conference on Integer Programming and Combinatorial Optimization, 2013-03-18 - 2013-03-20, Universidad Técnica Federico Santa María, Valparaiso, Chile, CHL.

Harvey, Nicholas J.A. and Olver, Neil ORCID: 0000-0001-8897-5459 (2014) Pipage rounding, pessimistic estimators and matrix concentration. In: SODA '14: Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, pp. 926-945. ISBN 9781611973389

Olver, Neil ORCID: 0000-0001-8897-5459 and Bruce Shepherd, F. (2013) Approximability of Robust Network Design. Mathematics of Operations Research. 561 - 572. ISSN 0364-765X

Amini, Omid, Devroye, Luc, Griffiths, Simon and Olver, Neil ORCID: 0000-0001-8897-5459 (2013) On explosions in heavy-tailed branching random walks. Annals of Probability, 41 (3B). 1864 - 1899. ISSN 0091-1798

Goyal, Navin, Olver, Neil ORCID: 0000-0001-8897-5459 and Bruce Shepherd, F. (2013) The VPN conjecture is true. Journal of the ACM, 60 (3). ISSN 0004-5411

Goemans, Michel, Olver, Neil ORCID: 0000-0001-8897-5459, Rothvoß, Thomas and Zenklusen, Rico (2012) Matroids and integrality gaps for hypergraphic steiner tree relaxations. In: STOC 2012 - 44th ACM Symposium on Theory of Computing, 2012-05-19 - 2012-05-22, New York, United States, USA.

Cole, Richard, Correa, Jose, Gkatzelis, Vasillis, Mirrokni, Vahab and Olver, Neil ORCID: 0000-0001-8897-5459 (2011) Decentralized utilitarian mechanisms for scheduling games. In: 43rd ACM Symposium on Theory of Computing, 2011-06-06 - 2011-06-08, San Jose, California, San Jose, United States, USA.

Goyal, Navin, Olver, Neil ORCID: 0000-0001-8897-5459 and Bruce Shepherd, F. (2010) Dynamic vs Oblivious Routing in Network Design. Algorithmica, 61 (1). 161 - 173. ISSN 0178-4617

Olver, Neil ORCID: 0000-0001-8897-5459 and Shepherd, Bruce (2010) Approximability of robust network design. In: ACM-SIAM Symposium on Discrete Algorithms, 2010-01-17 - 2010-01-19, Hyatt Regency Austin, Austin, United States, USA.

Goyal, Navin, Olver, Neil ORCID: 0000-0001-8897-5459 and Shepherd, Bruce (2009) Dynamic vs oblivious routing in network design. In: 17th Annual European Symposium on Algorithms, 2009-09-07 - 2009-09-09, University of Copenhagen, Copenhagen, Denmark, DNK.