2 citations · 6 across the 15 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 2 cited
Approximation of Steiner Forest via the Bidirected Cut Relaxation
Ali Çivril
The classical algorithm of Agrawal, Klein and Ravi [SIAM J. Comput., 24 (1995), pp. 440-456], stated in the setting of the primal-dual schema by Goemans and Williamson [SIAM J. Com…
cs.DS2019
A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem
Ali Çivril
We present a new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Its approximation ratio is , which matches the current best ratio.…