Lecture 26

Brian: Cheng, A. Y., & Ouyang, M. (2001). On algorithms for simplicial depth. In CCCG (pp. 53-56).
Brian: Liu, R. Y. (1990). On a notion of data depth based on random simplices. The Annals of Statistics, 18(1), 405-414.
Kairong: Biniaz, A., Bose, P., Carmi, P., Maheshwari, A., Munro, J. I., & Smid, M. (2018). Faster algorithms for some optimization problems on collinear points. arXiv preprint arXiv:1802.09505.
Kairong: Hsiao, J. Y., Tang, C. Y., & Chang, R. S. (1992). An efficient algorithm for finding a maximum weight 2-independent set on interval graphs. Information Processing Letters, 43(5), 229-235.
Brandon: Huang, G., & Dan Moore, R. (1993). Grey linear programming, its solving approach, and its application. International journal of systems science, 24(1), 159-172.
Brandon: Huang, G. H., Baetz, B. W., & Patry, G. G. (1994). Grey dynamic programming for waste-management planning under uncertainty. Journal of Urban Planning and Development, 120(3), 132-156.