16 citations · 30 across the 17 of their papers we have counts for
11 papers · 1 filter
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…
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…
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…
Improved Approximation Algorithms for Inventory Problems
Thomas Bosman, Neil Olver
We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we ar…
Algorithms for flows over time with scheduling costs
Dario Frascaria, Neil Olver
Flows over time have received substantial attention from both an optimization and (more recently) a game-theoretic perspective. In this model, each arc has an associated delay for…
Approximate Multi-Matroid Intersection via Iterative Refinement
André Linhares, Neil Olver, Chaitanya Swamy +1
We introduce a new iterative rounding technique to round a point in a matroid polytope subject to further matroid constraints. This technique returns an independent set in one matr…