Export Citations
2 Results for: Keyword: generalized minimum spanning tree
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,796,785 records)|Limit your search to The ACM Full-Text Collection (767,713 records)
Select All
- research-articleJuly 2010
An efficient algorithm for generalized minimum spanning tree problem
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computationPages 217–224https://doi.org/10.1145/1830483.1830525The Generalized Minimum Spanning Tree problem (GMST) has attracted much attention during the last few years. Since it is in-tractable, many heuristic algorithms have been proposed to solve large GMST instances. Motivated by the effectiveness and effi-...
- articleMarch 2004
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
Networks (NWKS), Volume 43, Issue 2Pages 71–86This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning Tree Problem (GMSTP). Given an undirected graph whose vertex set is partitioned into clusters, the GMSTP consists of determining a minimum-cost tree including exactly ...