New Algorithmic Results on the Connected p-Center Problem and Its Variants
碩士 === 世新大學 === 資訊管理學研究所(含碩專班) === 98 === The essential p-Center problem is to determine a set of p vertices of a graph G for building facilities. The objective is to minimize the maximum access distance of clients at all vertices. Let G(V, E, l, w) be a n-vertex and m-edge graph with lengths on edg...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/91313818201500460028 |