Conference paper
(1 + ε)-approximate sparse recovery
Eric Price, David P. Woodruff
FOCS 2011
Paper
Complexity of finding k-path-free dominating sets in graphs
Abstract
No abstract available.
Related
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Elliot Linzer, M. Vetterli
Computing
Maciel Zortea, Miguel Paredes, et al.
IGARSS 2021