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.
Gespeichert in:
| Veröffentlicht in: | Bezopasnostʹ informat͡s︡ionnykh tekhnologiĭ 2014-05, Vol.21 (2) |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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 |