A nearly optimal randomized algorithm for explorable heap selection (Q7019076)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7995999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nearly optimal randomized algorithm for explorable heap selection |
scientific article; zbMATH DE number 7995999 |
Statements
A nearly optimal randomized algorithm for explorable heap selection (English)
0 references
5 March 2025
0 references
graph exploration
0 references
branch-and-bound
0 references
node selection
0 references
online algorithm
0 references
0 references
0 references
0 references
