An experimental analysis of five neighborhoods is presented. The analysis includes a hybrid structure comprised of one random pair, two random pairs, three random pairs or four random pairs. The efficiency and effectiveness of each structure was tested using the minimum spanning tree problem. As proposed in this research paper, the hybrid structure approach applied to the minimum spanning tree problem demonstrates superior effectiveness and competitive efficiency as compared to other structures.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Neighborhood Hybrid Structure for Minimum Spanning Tree Problem




    Publication date :

    2012-11-01


    Size :

    310297 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    New Models of the Generalized Minimum Spanning Tree Problem

    Pop, P. C. | British Library Online Contents | 2004


    Node Splitting Algorithm of R^*-Tree Based on Minimum Spanning Tree

    Sun, D. / Sun, Y. / Kang, X. et al. | British Library Online Contents | 2011


    Radar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm

    Park, C. / Lee, H. / Musaffar, B. et al. | British Library Conference Proceedings | 2011


    Radar Data Tracking Using Minimum Spanning Tree-Based Clustering Algorithm

    Park, Chunki / Lee, Hak-tae / Musaffar, Bassam | AIAA | 2011


    On the probabilistic min spanning tree Problem

    Boria, N. / Murat, C. c. / Paschos, V. | British Library Online Contents | 2012