2 citations · 6 across the 15 of their papers we have counts for
Showing 2017 · cs.CCShow all
2 papers · 2 filters
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…
cs.CC2017
Improved Inapproximability Results for Steiner Tree via Long Code Based Reductions
Ali Çivril
The best algorithm for approximating Steiner tree has performance ratio [J. Byrka et al., \textit{Proceedings of the 42th Annual ACM Symposium on Theory of…