8 citations · 11 across the 5 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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.DS2014★ 1 cited
A note on hierarchical hubbing for a generalization of the VPN problem
Neil Olver
Robust network design refers to a class of optimization problems that occur when designing networks to efficiently handle variable demands. The notion of "hierarchical hubbing" was…