A new lower bound for the on-line coloring of intervals with bandwidth.
Patryk MikosPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- optimal solution
- np hard
- worst case
- branch and bound
- objective function
- lower bounding
- bandwidth allocation
- interval data
- lower and upper bounds
- upper and lower bounds
- network bandwidth
- linear programming relaxation
- optical networks
- polynomial approximation
- sufficiently accurate
- bandwidth utilization
- high bandwidth
- storage capacity
- video streaming
- knapsack problem
- multi objective
- special case
- computational complexity
- data structure