Analysis of Geometric Minimum Diameter Minimum Cost Spanning Trees
碩士 === 臺灣大學 === 資訊工程學研究所 === 96 === In this thesis, we consider a bicriteria problem, called minimum diameter minimum cost spanning tree (MDMCST) problem, which is to construct a minimum diameter spanning tree (MDST) among all possible minimum cost spanning trees (MST). The graph-theoretic version o...
Main Authors: | Chien-Yuen Chung, 鐘健元 |
---|---|
Other Authors: | 李德財 |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/80006063875600505049 |
Similar Items
-
Research on Geometrical Minimum Radius (Diameter) Minimum Cost Spanning Tree Problems
by: Tsung-Yi Ho, et al.
Published: (2001) -
Balancing Minimum Spanning Trees and Multiple-Source Minimum Routing Cost Spanning Trees on Metric Graphs
by: Chung-Ming Lin, et al.
Published: (2003) -
Diameter Constrained Fuzzy Minimum Spanning Tree Problem
by: Sk. Md. Abu Nayeem, et al.
Published: (2013-12-01) -
MODELS AND ALGORITHMS FOR THE DIAMETER CONSTRAINED MINIMUM SPANNING TREE PROBLEM
by: ANDREA CYNTHIA DOS SANTOS
Published: (2006) -
On the Minimum Ranking Spanning Tree Problem
by: Jui-Yuan Chang, et al.
Published: (2014)