6 citations · 14 across the 22 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 1 cited
Approximating Minimum-Cost Connected T-Joins
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…
math.CO2012★ 1 cited
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods
Eden Chlamtac, Zac Friggstad, Konstantinos Georgiou
Recently, Cygan, Kowalik, and Wykurz [IPL 2009] gave sub-exponential-time approximation algorithms for the Set-Cover problem with approximation ratios better than ln(n). In light o…