research
∙
08/04/2022
Efficiently Computing Directed Minimum Spanning Trees
Computing a directed minimum spanning tree, called arborescence, is a fu...
share
research
∙
10/22/2021
An Efficient Branch-and-Bound Solver for Hitting Set
The hitting set problem asks for a collection of sets over a universe U ...
research
∙
09/21/2020
Efficiently Computing Maximum Flows in Scale-Free Networks
We study the maximum-flow/minimum-cut problem on scale-free networks, i....
research
∙
05/16/2019
