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.
Detecting high log-densities: an ıt O(ıt n$^{\mbox{1/4}}$) approximation for densest ıt k-subgraph [link]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