Loading...
|
Please use this identifier to cite or link to this item:
http://ir.ncue.edu.tw/ir/handle/987654321/9976
|
Title: | The summation and bottleneck minimization for single step searching on weighted graphs |
Authors: | Hsiao, Ju-Yuan;Tang, C. Y.;Chang, R. S. |
Contributors: | 資訊工程系 |
Date: | 1993-10
|
Issue Date: | 2012-05-02T09:36:38Z
|
Publisher: | Elsevier BV |
Abstract: | In this paper, three types of problems for single-step searching weighted graphs are defined. They are the summation cost minimization, the bottleneck cost minimization, and a hybrid to minimize the maximum of the summation cost and the bottleneck cost. All three are shown to be NP-hard but polynomially solvable for trees. The bottleneck minimization is shown to be reducible to the summation minimization problem. |
Relation: | Information Sciences, 74(1-2): 1-28 |
Appears in Collections: | [資訊工程學系] 期刊論文
|
Files in This Item:
File |
Size | Format | |
2050400410001.pdf | 6Kb | Adobe PDF | 492 | View/Open |
|
All items in NCUEIR are protected by copyright, with all rights reserved.
|