Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network

Dengpan Zhou, Jie Gao. Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network. In INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 15-19 March 2010, San Diego, CA, USA. pages 511-515, IEEE, 2010. [doi]

@inproceedings{ZhouG10-0,
  title = {Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network},
  author = {Dengpan Zhou and Jie Gao},
  year = {2010},
  doi = {10.1109/INFCOM.2010.5462182},
  url = {http://dx.doi.org/10.1109/INFCOM.2010.5462182},
  tags = {mobile},
  researchr = {https://researchr.org/publication/ZhouG10-0},
  cites = {0},
  citedby = {0},
  pages = {511-515},
  booktitle = {INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 15-19 March 2010, San Diego, CA, USA},
  publisher = {IEEE},
  isbn = {978-1-4244-5838-7},
}