The summation and bottleneck minimization for single-step searching on weighted graphs

Yuan Hsiao Ju Yuan Hsiao, Yi Tang Chuan Yi Tang, Shiung Chang Ruay Shiung Chang

研究成果: Article

2 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)1-28
頁數28
期刊Information Sciences
74
發行號1-2
DOIs
出版狀態Published - 1993 十月 15

All Science Journal Classification (ASJC) codes

  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

指紋 深入研究「The summation and bottleneck minimization for single-step searching on weighted graphs」主題。共同形成了獨特的指紋。

  • 引用此