Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks.
Wenkai DaiMichael DinitzKlaus-Tycho FoersterLong LuoStefan SchmidPublished in: CoRR (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- facility location problem
- minimum cost
- dynamic routing
- network design problem
- vertex cover
- randomized algorithms
- set cover
- open shop
- primal dual
- undirected graph
- network structure
- disjoint paths
- constant factor approximation
- approximation schemes
- np hardness
- approximation ratio
- congestion control
- precedence constraints
- simulated annealing