614 citations · 773 across the 7 of their papers we have counts for
1 paper · 1 filter
Joseph Cheriyan, Zachary Friggstad, Zhihan Gao
We design and analyse approximation algorithms for the minimum-cost connected T-join problem: given an undirected graph G = (V;E) with nonnegative costs on the edges, and a subset…