Minimum cost paths over dynamic networks.
Enrico GrandeGaia NicosiaAndrea PacificiPublished in: Electron. Notes Discret. Math. (2016)
Keyphrases
- minimum cost
- dynamic networks
- np hard
- network flow problem
- minimum cost path
- network flow
- approximation algorithms
- network analysis
- network structure
- dynamic behavior
- spanning tree
- capacity constraints
- temporal evolution
- minimum cost flow
- network simplex algorithm
- special case
- biological networks
- real world networks
- social network analysis
- shortest path
- worst case
- data analysis
- objective function
- machine learning
- data mining