Algorithm for solving the problem of a backpack, based on traversing the tree of styling options
To reduce the time complexity of the basic algorithm for solving the problem of the backpack, we proposed a computational scheme based on the use of the stack graph.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Moscow Engineering Physics Institute
2014-05-01
|
| Series: | Bezopasnostʹ Informacionnyh Tehnologij |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/224 |
| Summary: | To reduce the time complexity of the basic algorithm for solving the problem of the backpack, we proposed a computational scheme based on the use of the stack graph. |
|---|---|
| ISSN: | 2074-7128 2074-7136 |