Navigation

Neil Olver

Full Name: Dr. N.K. Olver
Function(s): Researcher - Vrije Universiteit

Email: N.K.Olver@cwi.nl
Telephone: +31 20 592 4319
Room: M232a
Department(s): Networks and Optimization

Publications

Linhares, A, Olver, N.K, Swamy, C, & Zenklusen, R. (2019). Approximate Multi-matroid Intersection via Iterative Refinement. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-030-17953-3_23
Bosman, T, Frascaria, D. (Dario), Olver, N.K, Sitters, R.A, & Stougie, L. (2019). Fixed-Order Scheduling on Parallel Machines. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-030-17953-3_7
Olver, N.K, Pruhs, K, Schewior, K, Sitters, R.A, & Stougie, L. (2018). The itinerant list update problem. In Proceedings of the 16th Workshop on Approximation and Online Algorithms (WAOA 2018) (pp. 310–326). doi:10.1007/978-3-030-04693-4_19
Dadush, D.N, Guzman, C, & Olver, N.K. (2018). Fast, deterministic and sparse dimensionality reduction. In Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1330–1344).
Dadush, D.N, Guzman Paredes, C.A, & Olver, N.K. (2018). Fast, deterministic and sparse dimensionality reduction. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1330–1344). doi:10.1137/1.9781611975031.87
Bosman, T. (Thomas), & Olver, N.K. (2017). Exploring the tractability of the capped hose model. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.ESA.2017.19
Könemann, J, Olver, N.K, Pashkovich, K, Ravi, R, Swamy, C, & Vygen, J. (2017). On the integrality gap of the prize-collecting Steiner forest LP. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.APPROX-RANDOM.2017.17
Cominetti, R, Correa, J, & Olver, N.K. (2017). Long term behavior of dynamic equilibria in fluid queuing networks. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence. doi:10.1007/978-3-319-59250-3_14
Olver, N.K, & Végh, L.A. (2017). A simpler and faster strongly polynomial algorithm for generalized flow maximization. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 100–111). doi:10.1145/3055399.3055439
Olver, N.K, & Zenklusen, R. (2017). Chain-constrained spanning trees. Mathematical Programming, 1–22. doi:10.1007/s10107-017-1126-7