A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs.
Pietro CenciarelliDaniele GorlaIvano SalvoPublished in: CoRR (2016)
Keyphrases
- experimental evaluation
- optimization algorithm
- dynamic programming
- learning algorithm
- matching algorithm
- strongly polynomial
- detection algorithm
- worst case
- cost function
- particle swarm optimization
- computational cost
- high accuracy
- linear programming
- expectation maximization
- segmentation algorithm
- significant improvement
- preprocessing
- shortest path problem
- genetic algorithm
- np hard
- directed graph
- approximation algorithms
- undirected graph
- polynomial time approximation