57 citations · 154 across the 36 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Approximation algorithms for Steiner Tree Augmentation Problems
R. Ravi, Weizhong Zhang, Michael Zlatin
In the Steiner Tree Augmentation Problem (STAP), we are given a graph , a set of terminals , and a Steiner tree spanning . The edges $L := E \setmi…
cs.DS2022
Unit Perturbations in Budgeted Spanning Tree Problems
Hassene Aissi, Solal Attias, Da Qi Chen +1
The minimum spanning tree of a graph is a well-studied structure that is the basis of countless graph theoretic and optimization problem. We study the minimum spanning tree (MST) p…