1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Adaptive Out-Orientations with Applications
Chandra Chekuri, Aleksander Bjørn Christiansen, Jacob Holm +4
We give improved algorithms for maintaining edge-orientations of a fully-dynamic graph, such that the out-degree of each vertex is bounded. On one hand, we show how to orient the e…
cs.DS2023★ 1 cited
Faster exact and approximation algorithms for packing and covering matroids via push-relabel
Kent Quanrud
Matroids are a fundamental object of study in combinatorial optimization. Three closely related and important problems involving matroids are maximizing the size of the union of $k…