An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem |
scientific article |
Statements
An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (English)
0 references
14 December 2021
0 references
analysis of algorithms
0 references
on-line algorithms
0 references
Steiner traveling salesman problem
0 references
blockages
0 references
