activity
20102026
most citedOn explosions in heavy-tailed branching random walks

16 citations · 30 across the 17 of their papers we have counts for

collaborators

24 papers

cs.DS2026

Stochastic Load Balancing with Machine Reservations

David Alemán Espinosa, Naveen Garg, Sharat Ibrahimpur +2

We introduce a novel variant of stochastic load balancing that enables a quantitative tradeoff between the practical benefits of non-adaptive policies and their performance limitat…

cs.DS2026

Thin Trees for Near Minimum Cuts

Nathan Klein, Neil Olver, Zi Song Yeoh

The strong thin tree conjecture states that every -edge-connected graph contains an -thin spanning tree, meaning a spanning tree which contains at most an f…

cs.GT2024

Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time

Neil Olver, Leon Sering, Laura Vargas Koch

We consider a dynamic model of traffic that has received a lot of attention in the past few years. Infinitesimally small agents aim to travel from a source to a destination as quic…

cs.NI2023

Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding

Aleksander Figiel, Janne H. Korhonen, Neil Olver +1

Emerging optical and virtualization technologies enable the design of more flexible and demand-aware networked systems, in which resources can be optimized toward the actual worklo…

cs.DS2023

Thin trees for laminar families

Nathan Klein, Neil Olver

In the laminar-constrained spanning tree problem, the goal is to find a minimum-cost spanning tree which respects upper bounds on the number of times each cut in a given laminar fa…

cs.GT2021★ 8 cited

Long term behavior of dynamic equilibria in fluid queuing networks

Roberto Cominetti, José Correa, Neil Olver

A fluid queuing network constitutes one of the simplest models in which to study flow dynamics over a network. In this model we have a single source-sink pair and each link has a p…