Chinmay Hegde, Piotr Indyk, Ludwig Schmidt. A fast approximation algorithm for tree-sparse recovery. In 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014. pages 1842-1846, IEEE, 2014. [doi]
@inproceedings{HegdeIS14-1,
title = {A fast approximation algorithm for tree-sparse recovery},
author = {Chinmay Hegde and Piotr Indyk and Ludwig Schmidt},
year = {2014},
doi = {10.1109/ISIT.2014.6875152},
url = {http://dx.doi.org/10.1109/ISIT.2014.6875152},
researchr = {https://researchr.org/publication/HegdeIS14-1},
cites = {0},
citedby = {0},
pages = {1842-1846},
booktitle = {2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29 - July 4, 2014},
publisher = {IEEE},
}