K-relative neighborhood graphs and their applications to some euclidean bottleneck optimization problems
博士 === 國立清華大學 === 資訊科學研究所 === 78 === A Bottleneck optimization problem on general graphs with edge costs is the problem of finding a subgraph of a certain kind that minimizes the mzximum edge cost in the subgraph. a Euclidean bottleneck optimization problem is a bott...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1990
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/28862109953433864007 |