Congestion-Free Rerouting of Network Flows: Hardness and an FPT Algorithm.
Esra CeylanKrishnendu ChatterjeeStefan SchmidJakub SvobodaPublished in: NOMS (2024)
Keyphrases
- network flow
- computational complexity
- detection algorithm
- np hard
- cost function
- k means
- worst case
- matching algorithm
- particle swarm optimization
- linear programming
- preprocessing
- learning algorithm
- computational cost
- dynamic programming
- optimization model
- minimum cost
- simulated annealing
- optimization algorithm
- bit rate
- optimal solution