An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741)
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 O(n n) algorithm for the zoo-keeper's problem |
scientific article; zbMATH DE number 1902831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An O\((n\log n)\) algorithm for the zoo-keeper's problem |
scientific article; zbMATH DE number 1902831 |
Statements
An O\((n\log n)\) algorithm for the zoo-keeper's problem (English)
0 references
28 April 2003
0 references
shortest paths
0 references
zoo-keeper's problem
0 references
floodlight tree
0 references
0 references
0.8446511030197144
0 references
0.8103165030479431
0 references
