Deadline and buffer constrained knapsack problem
Elgabli, Anis; Aggarwal, Vaneet (2019-03-04)
Institute of Electrical and Electronics Engineers
04.03.2019
A. Elgabli and V. Aggarwal, "Deadline and Buffer Constrained Knapsack Problem," in IEEE Transactions on Circuits and Systems for Video Technology, vol. 29, no. 5, pp. 1564-1568, May 2019, doi: 10.1109/TCSVT.2019.2902759
https://rightsstatements.org/vocab/InC/1.0/
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2020111390307
https://urn.fi/URN:NBN:fi-fe2020111390307
Tiivistelmä
Abstract
In this paper, we formulate a problem that is a variant of the knapsack problem. Even though the problem is NP-hard in general, we consider a special case of the problem where the problem is in P. For this special case, the proposed algorithm is linear time complexity in the number of bins. The proposed framework is a generalization of the framework that has been used recently in the context of finding rate adaptation algorithms for video streaming.
Kokoelmat
- Avoin saatavuus [34150]