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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Neighborhood Hybrid Structure for Minimum Spanning Tree Problem




    Erscheinungsdatum :

    01.11.2012


    Format / Umfang :

    310297 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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