On the minimal travel time needed to collect \(n\) items on a circle. (Q1879896): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0405294 / rank | |||
Normal rank | |||
Revision as of 22:30, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the minimal travel time needed to collect \(n\) items on a circle. |
scientific article |
Statements
On the minimal travel time needed to collect \(n\) items on a circle. (English)
0 references
15 September 2004
0 references
