Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Bryant A. Julstrom. Greedy heuristics for the bounded diameter minimum spanning tree problem. ACM Journal of Experimental Algorithmics, 14, 2009. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree ProblemGünther R. Raidl, Bryant A. Julstrom. SAC 2003: 747-752 Greedy heuristics and evolutionary algorithms for the bounded minimum-label spanning tree problemArindam Khaled, Bryant A. Julstrom. gecco 2008: 611-612 [doi]
The following publications are possibly variants of this publication: