research
∙
05/04/2023
Convergence to Lexicographically Optimal Base in a (Contra)Polymatroid and Applications to Densest Subgraph and Tree Packing
Boob et al. [1] described an iterative peeling algorithm called Greedy++...
share
research
∙
03/02/2023
Faster exact and approximation algorithms for packing and covering matroids via push-relabel
Matroids are a fundamental object of study in combinatorial optimization...
research
∙
11/17/2021
Minimum Cuts in Directed Graphs via Partial Sparsification
We give an algorithm to find a minimum cut in an edge-weighted directed ...
research
∙
02/05/2018
