Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks

Hai Huang, Andréa W. Richa, Michael Segal. Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks. MONET, 9(2):151-161, 2004. [doi]

@article{HuangRS04,
  title = {Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks},
  author = {Hai Huang and Andréa W. Richa and Michael Segal},
  year = {2004},
  doi = {10.1023/B:MONE.0000013626.53247.1c},
  url = {http://dx.doi.org/10.1023/B:MONE.0000013626.53247.1c},
  tags = {mobile},
  researchr = {https://researchr.org/publication/HuangRS04},
  cites = {0},
  citedby = {0},
  journal = {MONET},
  volume = {9},
  number = {2},
  pages = {151-161},
}