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
•
01 Jan 2003
TL;DR: An approximation algorithm is presented that generates a tree whose diameter is no more than (1 + � ) times that of a GMDST, for any �> 0.05, improving the result by Gudmundsson et al.
Abstract: Given a set P of points in the plane, a geometric minimum-diameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. In this paper, we present an approximation algorithm that generates a tree whose diameter is no more than (1 + � ) times that of a GMDST, for any �> 0. Our algorithm reduces the problem to several grid-aligned versions of the problem and runs within time O(� −3 + n) and space O(n) improving the result by Gudmundsson et al. [4].
1 citations
••
1 citations
••
23 Nov 2015TL;DR: A novel clustering scheme based on hierarchical agglomerative clustering algorithm that is less energy-consuming than LEACH, HEED and clustering protocol using k-means algorithm is proposed.
Abstract: Improving the lifetime of wireless sensor networks (WSNs) remains an open and active research area. One of the challenging problems in this field is the partitioning of a WSN into disjoint clusters so that the network lifetime is maximized. In particular, the selection of a head for each cluster should consider various parameters related to transmission costs. In this paper, we propose a novel clustering scheme based on hierarchical agglomerative clustering algorithm. The selection of the cluster heads is based on the proximity with a virtual node representing the optimal head location with respect to energy consumption. The proposed algorithm is re-executed at each packet delivering round to maintain energy efficiency during the whole network lifetime. In the transmission of packets to BS, we consider two cases: - Single Hop transmission between CHs and BS that, each CH directly send packets to BS. and - Multi-Hop transmission between the BS and CHs that, each CH transmits to another CH or to a base station according to the results obtained by the algorithm of the spanning tree Experimental results show that our clustering scheme is less energy-consuming than LEACH, HEED and clustering protocol using k-means algorithm.
1 citations
••
TL;DR: An edge encoding based new genetic algorithm using a spanning tree using the MAX CUT problem, which is well known as a representative NP-hard problem, and the performance of the proposed genetic algorithm is examined.
Abstract: Most of previous genetic algorithms for solving graph problems have used a vertex-based encoding We proposed an edge encoding based new genetic algorithm using a spanning tree Contrary to general edge-based encoding, a spanning tree-based encoding represents only feasible partitions As a target problem, we adopted the MAX CUT problem, which is well known as a representative NP-hard problem, and examined the performance of the proposed genetic algorithm The experiments on benchmark graphs are executed and compared with vertex-based encoding Performance improvements of the spanning tree-based encoding on sparse graphs was observed
1 citations