Approximation Performance of the (1+1) Evolutionary Algorithm for the Minimum Degree Spanning Tree Problem

2015 ◽  
pp. 505-512
Author(s):  
Xiaoyun Xia ◽  
Yuren Zhou
Keyword(s):  
Evolutionary Algorithm ◽  
Spanning Tree ◽  
Minimum Degree

scholarly journals A dandelion-encoded evolutionary algorithm for the delay-constrained capacitated minimum spanning tree problem

2009 ◽  
Vol 32 (1) ◽  
pp. 154-158 ◽  
Author(s):  
Angel M. Pérez-Bellido ◽  
Sancho Salcedo-Sanz ◽  
Emilio G. Ortiz-Garcı´a ◽  
Antonio Portilla-Figueras ◽  
Maurizio Naldi
Keyword(s):  
Evolutionary Algorithm ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Capacitated Minimum Spanning Tree ◽  
Minimum Spanning Tree Problem

scholarly journals THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS

2004 ◽  
Vol 15 (03) ◽  
pp. 507-516 ◽  
Author(s):  
LÉLIA BLIN ◽  
FRANCK BUTELLE
Keyword(s):  
Distributed Algorithm ◽  
Spanning Tree ◽  
Time Complexity ◽  
Minimum Degree ◽  
Np Hard ◽  
Message Complexity ◽  
General Graphs

In this paper we present the first distributed algorithm on general graphs for the Minimum Degree Spanning Tree problem. The problem is NP-hard in sequential. Our algorithm give a Spanning Tree of a degree at most 1 from the optimal. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves O(|V|) time complexity and O(|V||E|) message complexity.

Sign in / Sign up

Export Citation Format

Share Document