Polynomial time approximation algorithms for multi-constrained QoS routing.
Guoliang XueWeiyi ZhangJian TangKrishnaiyan ThulasiramanPublished in: IEEE/ACM Trans. Netw. (2008)
Keyphrases
- approximation algorithms
- qos routing
- special case
- np hard
- approximation ratio
- worst case
- quality of service
- vertex cover
- open shop
- np hardness
- minimum cost
- randomized algorithms
- routing algorithm
- primal dual
- ad hoc networks
- polynomial time approximation
- mobile ad hoc networks
- set cover
- constant factor
- message overhead
- precedence constraints
- approximation guarantees
- end to end
- disjoint paths