Fast approximation of steiner trees in large graphs.
Andrey Gubichev|Thomas Neumann
| Anthology ID: | DBLP:conf/cikm/GubichevN12 |
|---|---|
| Volume: | 21st ACM International Conference on Information and Knowledge Management, CIKM'12, Maui, HI, USA, October 29 - November 02, 2012 |
| Year: | 2012 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 1497-1501 |
| URL: | https://doi.org/10.1145/2396761.2398460 |
| DOI: | https://doi.org/10.1145/2396761.2398460 |
| DBLP: | conf/cikm/GubichevN12 |
| BibTeX: |
@inproceedings{gubichev-2012-fast,
author = {Andrey Gubichev and
Thomas Neumann},
editor = {Xue-wen Chen and
Guy Lebanon and
Haixun Wang and
Mohammed J. Zaki},
title = {{Fast approximation of steiner trees in large graphs}},
booktitle = {{21st ACM International Conference on Information and Knowledge Management, CIKM'12, Maui, HI, USA, October 29 - November 02, 2012}},
pages = {1497--1501},
publisher = {ACM},
year = {2012},
url = {https://doi.org/10.1145/2396761.2398460},
doi = {https://doi.org/10.1145/2396761.2398460}
}