Hardness and approximation of traffic grooming.
Omid AminiStéphane PérennesIgnasi SauPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- np complete
- network traffic
- approximation methods
- computational complexity
- np hard
- closed form
- traffic flow
- anomaly detection
- error bounds
- traffic volume
- image sequences
- agnostic learning
- traffic patterns
- np hardness
- traffic management
- telecommunication networks
- approximation error
- phase transition
- approximation algorithms