Algorithms for the thief orienteering problem on directed acyclic graphs (Q6652432)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7957580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the thief orienteering problem on directed acyclic graphs |
scientific article; zbMATH DE number 7957580 |
Statements
Algorithms for the thief orienteering problem on directed acyclic graphs (English)
0 references
12 December 2024
0 references
thief-orienteering problem
0 references
knapsack problem
0 references
dynamic programming
0 references
approximation algorithm
0 references
approximation scheme
0 references
0 references
0 references
0.7893435955047607
0 references
0.7448034882545471
0 references
0.7297953963279724
0 references
0.725714921951294
0 references
