Topic
Prim's algorithm
About: Prim's algorithm is a research topic. Over the lifetime, 775 publications have been published within this topic receiving 17971 citations. The topic is also known as: DJP algorithm & Jarník algorithm.
Papers published on a yearly basis
Papers
More filters
08 Oct 2007
TL;DR: The proposed memetic algorithm for the OCST problem outperforms evolutionary algorithms (EA) for known benchmark instances and outperforms state-of-the-art solvers for non-Euclidean instances.
Abstract: For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each pair of nodes routed over the tree. We present a memetic algorithm (MA) for this problem and focus our discussion on the evaluation of recombination operators for the OCST. The proposed algorithm outperforms evolutionary algorithms (EA) for known benchmark instances and outperforms state-of-the-art solvers for non-Euclidean instances.
17 citations
01 Jan 1997
17 citations
20 Sep 2004
TL;DR: Preliminary work is reported which indicates sophisticated versions of the new encoding can outperform edge-set on at least some classes of DC-MST, and the new method outperforms the comparative encodings.
Abstract: We present an effective new encoding method for use by black-box optimisation methods when addressing tree-based combinatorial problems. It is simple, easily handles degree constraints, and is easily extendable to incorporate problem-specific knowledge. We test it on published benchmark degree-constrained minimum spanning tree (DC-MST) problems, comparing against two other well-known encodings. The new method outperforms the comparative encodings. We have not yet compared against the recently published ‘edge-sets’ encoding, however we can report preliminary work which indicates sophisticated versions of the new encoding can outperform edge-set on at least some classes of DC-MST.
17 citations
TL;DR: An artificial bee colony (ABC) algorithm for the tree t-spanner problem, where ABC algorithm is a swarm intelligence technique inspired by intelligent foraging behavior of honey bees that makes ABC algorithm highly effective in searching high quality solutions in less computational time.
16 citations
05 Jun 1989
TL;DR: A distributed algorithm based on echo algorithms is presented which constructs the minimum-weight spanning tree in a general undirected graph which needs only (m) messages and O(d) time.
Abstract: A distributed algorithm based on echo algorithms is presented which constructs the minimum-weight spanning tree in a general undirected graph In the worst case, the algorithm needs at most (2m+2(n-1) log (n/2)) messages and (2d log n) time, where d is the diameter of the network In the best case, it needs only 2m messages and 2d time The algorithm works in phases, and each phase consists of a down wave and an up wave When the number of fragments is cut by at least one half in each phase, it needs at most O(log n) phases On average, the algorithm needs only (m) messages and O(d) time The algorithm itself is simple, so that other distributed algorithms based on it can be derived more easily >
16 citations