Detecting high log-densities: an ıt O(ıt n$^{\mbox{1/4}}$) approximation for densest ıt k-subgraph. Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., & Vijayaraghavan, A. In STOC, pages 201-210, 2010. Link bibtex @inproceedings{DBLP:conf/stoc/BhaskaraCCFV10,
author = {Aditya Bhaskara and
Moses Charikar and
Eden Chlamtac and
Uriel Feige and
Aravindan Vijayaraghavan},
title = {Detecting high log-densities: an {\it O}({\it n}$^{\mbox{1/4}}$)
approximation for densest {\it k}-subgraph},
booktitle = {STOC},
year = {2010},
pages = {201-210},
ee = {http://doi.acm.org/10.1145/1806689.1806718},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Downloads: 0
{"_id":"eeo6kqBzdenyPNGFb","bibbaseid":"bhaskara-charikar-chlamtac-feige-vijayaraghavan-detectinghighlogdensitiesantotnmbox14approximationfordensesttksubgraph-2010","author_short":["Bhaskara, A.","Charikar, M.","Chlamtac, E.","Feige, U.","Vijayaraghavan, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Aditya"],"propositions":[],"lastnames":["Bhaskara"],"suffixes":[]},{"firstnames":["Moses"],"propositions":[],"lastnames":["Charikar"],"suffixes":[]},{"firstnames":["Eden"],"propositions":[],"lastnames":["Chlamtac"],"suffixes":[]},{"firstnames":["Uriel"],"propositions":[],"lastnames":["Feige"],"suffixes":[]},{"firstnames":["Aravindan"],"propositions":[],"lastnames":["Vijayaraghavan"],"suffixes":[]}],"title":"Detecting high log-densities: an ıt O(ıt n$^{\\mbox{1/4}}$) approximation for densest ıt k-subgraph","booktitle":"STOC","year":"2010","pages":"201-210","ee":"http://doi.acm.org/10.1145/1806689.1806718","bibsource":"DBLP, http://dblp.uni-trier.de","bibtex":"@inproceedings{DBLP:conf/stoc/BhaskaraCCFV10,\n author = {Aditya Bhaskara and\n Moses Charikar and\n Eden Chlamtac and\n Uriel Feige and\n Aravindan Vijayaraghavan},\n title = {Detecting high log-densities: an {\\it O}({\\it n}$^{\\mbox{1/4}}$)\n approximation for densest {\\it k}-subgraph},\n booktitle = {STOC},\n year = {2010},\n pages = {201-210},\n ee = {http://doi.acm.org/10.1145/1806689.1806718},\n bibsource = {DBLP, http://dblp.uni-trier.de}\n}\n\n\n","author_short":["Bhaskara, A.","Charikar, M.","Chlamtac, E.","Feige, U.","Vijayaraghavan, A."],"key":"DBLP:conf/stoc/BhaskaraCCFV10","id":"DBLP:conf/stoc/BhaskaraCCFV10","bibbaseid":"bhaskara-charikar-chlamtac-feige-vijayaraghavan-detectinghighlogdensitiesantotnmbox14approximationfordensesttksubgraph-2010","role":"author","urls":{"Link":"http://doi.acm.org/10.1145/1806689.1806718"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"people.csail.mit.edu/andyd/CCI_refs.bib","dataSources":["6sSgqzaHAPRWvSxTP"],"keywords":[],"search_terms":["detecting","high","log","densities","mbox","approximation","densest","subgraph","bhaskara","charikar","chlamtac","feige","vijayaraghavan"],"title":"Detecting high log-densities: an ıt O(ıt n$^{\\mbox{1/4}}$) approximation for densest ıt k-subgraph","year":2010}