National Changhua University of Education Institutional Repository : Item 987654321/9976
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6507/11669
造访人次 : 30057968      在线人数 : 509
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/9976

题名: The summation and bottleneck minimization for single step searching on weighted graphs
作者: Hsiao, Ju-Yuan;Tang, C. Y.;Chang, R. S.
贡献者: 資訊工程系
日期: 1993-10
上传时间: 2012-05-02T09:36:38Z
出版者: Elsevier BV
摘要: 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.
關聯: Information Sciences, 74(1-2): 1-28
显示于类别:[資訊工程學系] 期刊論文

文件中的档案:

档案 大小格式浏览次数
2050400410001.pdf6KbAdobe PDF536检视/开启


在NCUEIR中所有的数据项都受到原著作权保护.

 

DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈