首页 > 《应用数学学报：英文版》 > 1989年1期 > 0N THE COMPLEXITY OF AN OPTIMAL ROUTING TREE PROBLEM

0N THE COMPLEXITY OF AN OPTIMAL ROUTING TREE PROBLEM

打印

在线阅读下载PDF 导出详情

摘要 Aroutingtreeforasetoftasksisadecisiontreewhichassignsthetaskstotheirdestinationsaccordingtothefeaturesofthetasks.Aweightedroutingtreeisonewithcostsattachedtoeachlinkofthetree.Linksofthesamefeaturehavethesamecost.Itisprovedthattheproblemoffinding?routingtreeoftheminimumcostforagivensetoftasksoftwofeaturesisNP-complete.

DOI rj8yewkr40/731110

作者堵丁柱;KER-IKo

机构地区不详

出处《应用数学学报：英文版》 1989年1期

关键词 ROUTING ATTACHED labeled finding COSTS 二七

分类 [理学][基础数学]

出版日期 1989年01月11日（中国Betway体育网页登陆平台首次上网日期，不代表论文的发表时间）

相关文献

1罗静.0N—2000在杨家坪供电局的应用.电力系统及自动化,2003-01.
2Xi Xia Jin-chuan Cui.A Method of Estimating Computational Complexity Based on Input Conditions for N-vehicle Problem.基础数学,2010-01.
3朱砾;李秀华;郭兴明.Optimal obstacle control problem.力学,2008-05.
4Xiaoguang YANG;Jianzhong ZHANG.INVERSE CENTER LOCATION PROBLEM ON A TREE.系统科学,2008-04.
5A. Ridolfo; R. Stassi;O. Di Stefano.Hidden Vacuum Rabi Oscillations： Dynamical Quantum Superpositions of 0n/off Interaction between a Single Quantum Dot and a Microcavity.物理,2017-06.
6Xiao-feiHu;Pei-xinYe.QUANTUM COMPLEXITY OF THE INTEGRATION PROBLEM FOR ANISOTROPIC CLASSES.计算数学,2005-03.
7Arezki TOUZALINE.Optimal Control of a Frictional Contact Problem.基础数学,2015-04.
8Arthur.G.Werschulz.THE AVERAGE CASE COMPLEXITY OF THE SHIFT-INVARIANT PROBLEM.基础数学,1998-01.
9高随祥;林国辉.Decision Tree Complexity of Graph Properties with Dimension at Most5.计算机科学与技术,2000-05.
10.A Routing Algorithm for Distributed Optimal Double Loop Computer Networks.物理电子学,1994-01.

来源期刊

应用数学学报：英文版

应用数学学报：英文版

相关推荐

同分类资源更多

相关关键词

ROUTING ATTACHED labeled finding COSTS 二七

返回顶部