.png){kind=icon}
Return
Generalized spanning trees
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00006-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
agriculture
irrigation network
minimum spanning tree
traveling salesman problem
Steiner problem
worst case analysis
genetic algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSave
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
ShareSaveShareSave
View more