Items where Author is "Olver, Neil"

Number of items: 43.
Article
  • A duality based 2-approximation algorithm for maximum agreement forest. (2023) Olver, Neil; Schalekamp, Frans; van der Ster, Suzanne; Stougie, Leen; van Zuylen, Anke picture_as_pdf
  • Algorithms for flows over time with scheduling costs. Frascaria, Dario; Olver, Neil picture_as_pdf
  • Approximability of Robust Network Design. Olver, Neil; Bruce Shepherd, F.
  • Approximate multi-matroid intersection via iterative refinement. Linhares, André; Olver, Neil; Swamy, Chaitanya; Zenklusen, Rico picture_as_pdf
  • Chain-constrained spanning trees. Olver, Neil; Zenklusen, Rico picture_as_pdf
  • Decentralized utilitarian mechanisms for scheduling games. Cole, Richard; Correa, Jose; Gkatzelis, Vasillis; Mirrokni, Vahab; Olver, Neil picture_as_pdf
  • Dynamic vs Oblivious Routing in Network Design. Goyal, Navin; Olver, Neil; Bruce Shepherd, F.
  • Emergent hypercongestion in Vickrey bottleneck networks. Frascaria, Dario; Olver, Neil; Verhoef, Erik picture_as_pdf
  • Explosion and linear transit times in infinite trees. Amini, Omid; Devroye, Luc; Griffiths, Simon; Olver, Neil picture_as_pdf
  • Long-term behavior of dynamic equilibria in fluid queuing networks. Cominetti, Roberto; Correa, José; Olver, Neil picture_as_pdf
  • On explosions in heavy-tailed branching random walks. Amini, Omid; Devroye, Luc; Griffiths, Simon; Olver, Neil
  • On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Feldmann, Andreas Emil; Könemann, Jochen; Olver, Neil; Sanitàa, Laura picture_as_pdf
  • Performance of the smallest-variance-first rule in appointment sequencing. de Kemp, Madelon A; Mandjes, Michel; Olver, Neil picture_as_pdf
  • The VPN conjecture is true. Goyal, Navin; Olver, Neil; Bruce Shepherd, F.
  • A note on hierarchical hubbing for a generalization of the VPN problem. Olver, Neil picture_as_pdf
  • A short proof of convexity of step-out–step-in sequencing games. Beeson, Coulter; Olver, Neil picture_as_pdf
  • A simpler and faster strongly polynomial algorithm for generalized flow maximization. Olver, Neil; Végh, László A. picture_as_pdf
    • Chapter
  • Efficient algorithms for demand-aware networks and a connection to virtual network embedding. (2025) Figiel, Aleksander; Korhonen, Janne H.; Olver, Neil; Schmid, Stefan picture_as_pdf
  • A strongly polynomial algorithm for linear programs with at most two nonzero entries per row or column. (2024) Dadush, Daniel; Koh, Zhuan Khye; Natura, Bento; Olver, Neil; Végh, László A. picture_as_pdf
  • Convergence of approximate and packet routing equilibria to Nash flows over time. (2023) Olver, Neil; Sering, Leon; Vargas Koch, Laura picture_as_pdf
  • Algorithms for flows over time with scheduling costs. Frascaria, Dario; Olver, Neil picture_as_pdf
  • Approximate multi-matroid intersection via iterative refinement. Linhares, Andre; Olver, Neil; Swamy, Chaitanya; Zenklusen, Rico
  • Continuity, uniqueness and long-term behavior of Nash flows over time. Olver, Neil; Sering, Leon; Vargas Koch, Laura picture_as_pdf
  • Fixed-order scheduling on parallel machines. Bosman, Thomas; Frascaria, Dario; Olver, Neil; Sitters, Rene; Stougie, Leen
  • Improved approximation algorithms for inventory problems. Bosman, Thomas; Olver, Neil picture_as_pdf
  • Long term behavior of dynamic equilibria in fluid queuing networks. Cominetti, Roberto; Correa, Jose; Olver, Neil
  • Majorizing measures for the optimizer. Borst, Sander; Dadush, Daniel; Olver, Neil; Sinha, Makrand picture_as_pdf
  • Pipage rounding, pessimistic estimators and matrix concentration. Harvey, Nicholas J.A.; Olver, Neil
  • Thin trees for laminar families. Klein, Nathan; Olver, Neil picture_as_pdf
  • The itinerant list update problem. Olver, Neil; Pruhs, Kirk; Schewior, Kevin; Sitters, Rene; Stougie, Leen
  • A simpler and faster strongly polynomial algorithm for generalized flow maximization. Olver, Neil; Végh, László A.
    • Conference or Workshop Item
  • Adaptive Rumor Spreading. Correa, Jose; Kiwi, Marcos; Olver, Neil; Vera, Alberto
  • Approximability of robust network design. Olver, Neil; Shepherd, Bruce
  • Chain-constrained spanning trees. Olver, Neil; Zenklusen, Rico
  • Decentralized utilitarian mechanisms for scheduling games. Cole, Richard; Correa, Jose; Gkatzelis, Vasillis; Mirrokni, Vahab; Olver, Neil
  • Dynamic vs oblivious routing in network design. Goyal, Navin; Olver, Neil; Shepherd, Bruce
  • Exploring the tractability of the capped hose model. Bosman, Thomas; Olver, Neil
  • Fast, deterministic and sparse dimensionality reduction. Dadush, Daniel; Guzmán, Cristóbal; Olver, Neil
  • Matroids and integrality gaps for hypergraphic steiner tree relaxations. Goemans, Michel; Olver, Neil; Rothvoß, Thomas; Zenklusen, Rico
  • On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Feldmann, Andreas Emil; Könemann, Jochen; Olver, Neil; Sanitàa, Laura
  • On the integrality gap of the prize-collecting steiner forest LP. Könemann, Jochen; Olver, Neil; Pashkovich, Kanstantsin; Ravi, R; Swamy, Chaitanya; Vygen, Jens
  • A simpler and faster strongly polynomial algorithm for generalized flow maximization. Olver, Neil; Végh, László A.
    • ['eprint_typename_blog_post' not defined]
  • Favourite open problems:Prof. Benny Sudakov. Olver, Neil picture_as_pdf