2 citations · 2 across the 2 of their papers we have counts for
2 papers
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.CC2017
Sparse Approximation is Provably Hard under Coherent Dictionaries
Ali Çivril
It is well known that sparse approximation problem is \textsf{NP}-hard under general dictionaries. Several algorithms have been devised and analyzed in the past decade under variou…