An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem (Q2059872)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem |
scientific article; zbMATH DE number 7444806
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem |
scientific article; zbMATH DE number 7444806 |
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
0 references
0 references
0 references
