Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Finding Edge-disjoint Paths in Networks: An Ant Colony Optimization Algorithm


    Contributors:
    Blesa, M. J. (author) / Blum, C. (author)


    Publication date :

    2007-01-01


    Size :

    31 pages



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English


    Classification :

    DDC:    003.3



    The Complexity of Packing Edge-Disjoint Paths

    Dreier, Jan / Fuchs, Janosch / Hartmann, Tim A. et al. | BASE | 2019

    Free access


    Robustly disjoint paths with segment routing

    Aubry, François / Vissicchio, Stefano / Bonaventure, Olivier et al. | BASE | 2018

    Free access


    On Routing Disjoint Paths in Bounded Treewidth Graphs

    Ene, Alina / Mnich, Matthias / Pilipczuk, Marcin et al. | BASE | 2016

    Free access