16 citations · 30 across the 17 of their papers we have counts for
1 paper · 2 filters
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…