Finding an Anti-k-Centrum on a Tree
碩士 === 國立臺北商業大學 === 資訊與決策科學研究所 === 104 === In this paper, we study the anti-k-centrum problem on a tree. Given a tree with vertices being the demand points, the objective is to site a point, maximizing the sum of the k smallest distances to the demand points. When the given graph is a path with iden...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/3b3954 |