A polynomial time algorithm for the minimum flow problem in time-varying networks.
Salman KhodayifarMohammad Ali RaayatpanahPanos M. PardalosPublished in: Ann. Oper. Res. (2019)
Keyphrases
- worst case
- dynamic programming
- search space
- high accuracy
- experimental evaluation
- times faster
- preprocessing
- cost function
- detection algorithm
- computational complexity
- optimal solution
- objective function
- computational cost
- learning algorithm
- input data
- theoretical analysis
- segmentation algorithm
- optimization algorithm
- significant improvement
- k means
- similarity measure
- complex networks
- min cost
- probabilistic model
- np hard
- social networks