Computing distance-bounded node-disjoint paths for all pairs of nodes - An application to optical core network design.
Deepak MehtaBarry O'SullivanCemalletin OzturkLuis QuesadaPublished in: RNDM@WMNC (2015)
Keyphrases
- disjoint paths
- network design
- directed graph
- undirected graph
- approximation algorithms
- network design problem
- communication networks
- switched networks
- shortest distance
- network architecture
- facility location
- graph structure
- shortest path
- random walk
- neural network
- connected components
- tree structure
- ip networks
- distance matrix
- special case
- lower bound
- data mining