A new lower bound for the on-line coloring of intervals with bandwidth.
Patryk MikosPublished in: CoRR (2017)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- optimal solution
- lower and upper bounds
- branch and bound
- objective function
- worst case
- lower bounding
- video streaming
- network bandwidth
- sufficiently accurate
- endpoints
- upper and lower bounds
- lagrangian relaxation
- dynamic time warping
- real numbers
- storage capacity
- interval data
- allocation scheme
- bandwidth consumption