Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks.
Wenkai DaiMichael DinitzKlaus-Tycho FoersterLong LuoStefan SchmidPublished in: INFOCOM (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- dynamic routing
- vertex cover
- primal dual
- np hardness
- facility location problem
- minimum cost
- network design
- network design problem
- set cover
- randomized algorithms
- approximation ratio
- constant factor
- congestion control
- learning algorithm
- approximation schemes
- combinatorial auctions
- lead time
- disjoint paths
- constant factor approximation