.png){kind=icon}
返回
Generalized spanning trees
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00006-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper. we propose a definition for the Generalized Minimal Spanning Tree (GMST) of a graph. The GMST requires spanning at least one node out of every set of disjoint nodes (node partition) in a graph. The analysis of the GMST problem is motivated by real life agricultural settings related to construction of irrigation networks in desert environments. We prove that the GMST problem is NP-hard, and examine a number of heuristic solutions for this problem. Computational experiments comparing these heuristics are presented. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
agriculture
irrigation network
minimum spanning tree
traveling salesman problem
Steiner problem
worst case analysis
genetic algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Labeling of the Internal Pool of GP IIb-IIIa in Platelets by c7E3 Fab Fragments (abciximab): Flow and Endocytic Mechanisms Contribute to the Transport.png)
Blood
BloodIF0
PREAI
分享收藏
查看更多内容