1. Lecture Notes in Computer Science;B. Ben-Moshe,2006
2. Ben-Moshe, B., Bhattacharya, B., Shi, Q., Tamir, A.: Efficient algorithms for center problems in cactus networks. Theoretical Computer Science 378(3), 237–252 (2007)
3. Benkoczi, R.: Cardinality constrained facility location problems in trees. Ph.D. thesis, School of Computing Science. Simon Fraser University, Canada (2004)
4. Lecture Notes in Computer Science;R. Benkoczi,2003
5. Bhattacharya, B., Kameda, T., Song, Z.: Minmax regret 1-center on a path/cycle/tree. In: Proc. 6th Int’l Conf. on Advanced Engineering Computing and Applications in Sciences (ADVCOMP), pp. 108–113 (2012),
http://www.thinkmind.org/index.php?view=article&articleid=advcomp_2012_5_20_20093