Heuristics for Minimum Spanning K-tree Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Heuristics for Minimum Spanning K-tree Problem

Published:2014 Issue: Volume:31 Page:1074-1083
ISSN:1877-0509
Container-title:Procedia Computer Science
language:en
Short-container-title:Procedia Computer Science

Author:

Shangin Roman E.,Pardalos Panos M.

Publisher

Elsevier BV

Subject

General Engineering

Reference12 articles.

1. Rose D. On simple characterizations of k-trees. Discrete Mathematics 1974;41:317-322.

2. Prim R. Shortest connection networks and some generalizations. Bell Systems Techn. J. 1957;36:1389-1401.

3. Farley A. Networks immune to isolated failures. Networks 1981;11:255-268.

4. Bern M. Networks Design Problems: Steiner Trees and Spanning k-Trees, Ph. D. Thesis. University of Berkeley; 1987.

5. Cai L., Maffray F. On the spanning k-tree problem. University of Toronto; 1992.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Trees and Forests;Handbook of Heuristics;2018

2. Land consolidation of small-scale farms in preparation for a cane harvester;Computers and Electronics in Agriculture;2017-11

3. Algorithm for the discrete Weber’s problem with an accuracy estimate;Automation and Remote Control;2016-07

4. Data Science for Massive Networks;Communications in Computer and Information Science;2016

5. Trees and Forests;Handbook of Heuristics;2016

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP