2 citations · 2 across the 10 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
Meike Neuwohner, Olha Silina, Michael Zlatin
We introduce and study a directed analogue of the weighted Tree Augmentation Problem (WTAP). In the weighted Directed Tree Augmentation Problem (WDTAP), we are given an oriented tr…
cs.DS2025
Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids
Stephen Arndt, Benjamin Moseley, Kirk Pruhs +1
This paper shows a polynomial-time algorithm that, given a general matroid and partition matroids , produces a coloring of the intersection $M = \cap…