11 citations · 20 across the 7 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DM2018
When Do Gomory-Hu Subtrees Exist?
Guyslain Naves, F. Bruce Shepherd
Gomory-Hu (GH) Trees are a classical sparsification technique for graph connectivity. It is one of the fundamental models in combinatorial optimization which also continually finds…
cs.DS2018★ 2 cited
Multi-Agent Submodular Optimization
Richard Santiago, F. Bruce Shepherd
Recent years have seen many algorithmic advances in the area of submodular optimization: (SO) , where is a given family of feasible…