Vertex Disjoint Paths for Dispatching in Railways.
Holger FlierMatús MihalákAnita SchöbelPeter WidmayerAnna ZychPublished in: ATMOS (2010)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- scheduling problem
- directed acyclic graph
- connected components
- minimum cost
- flexible manufacturing systems
- spanning tree
- manufacturing systems
- random walk
- special case
- graph structure
- complex networks
- production scheduling
- dynamic routing
- real time
- np hard