Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles

Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song. Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles. In Alberto Pardo, Alfredo Viola, editors, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings. Volume 8392 of Lecture Notes in Computer Science, pages 330-341, Springer, 2014. [doi]

@inproceedings{BhattacharyaKS14,
  title = {Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles},
  author = {Binay K. Bhattacharya and Tsunehiko Kameda and Zhao Song},
  year = {2014},
  doi = {10.1007/978-3-642-54423-1_29},
  url = {http://dx.doi.org/10.1007/978-3-642-54423-1_29},
  researchr = {https://researchr.org/publication/BhattacharyaKS14},
  cites = {0},
  citedby = {0},
  pages = {330-341},
  booktitle = {LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings},
  editor = {Alberto Pardo and Alfredo Viola},
  volume = {8392},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-54422-4},
}