Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems |
scientific article |
Statements
Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (English)
0 references
16 August 2022
0 references
rooted walk
0 references
prize-collecting cost
0 references
combinatorial approximation algorithms
0 references
0 references
0 references
0 references
