On Approximation Hardness of the Bandwidth Problem
Marek KarpinskiJuergen WirtgenPublished in: Electron. Colloquium Comput. Complex. (1997)
Keyphrases
- error bounds
- approximation algorithms
- np hard
- agnostic learning
- phase transition
- approximation error
- computational complexity
- np complete
- information theoretic
- learning theory
- np hardness
- bandwidth requirements
- database
- approximation schemes
- approximation ratio
- polygonal approximation
- network bandwidth
- relative error
- video streaming
- closed form
- wireless networks
- data sets