The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights.
Cong ZhangHiroshi NagamochiPublished in: CATS (2012)
Keyphrases
- shortest path
- undirected graph
- edge weights
- directed acyclic graph
- directed graph
- shortest path problem
- spanning tree
- road network
- complex networks
- travel time
- approximation algorithms
- graph structure
- minimum cost
- multicommodity flow
- routing algorithm
- connected components
- routing problem
- linear programming
- objective function
- optimal path
- weighted graph
- finding the shortest path
- shortest path algorithm
- vertex set
- path selection
- steiner tree
- flow graph
- path length
- shortest distance
- np hard