Tight analysis of a self-approaching strategy for the online kernel-search problem (Q294606): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5501793 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Self-approaching curves / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Walking an unknown street with bounded detour / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Curves with increasing chords / rank | |||
Normal rank | |||
Revision as of 04:47, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight analysis of a self-approaching strategy for the online kernel-search problem |
scientific article |
Statements
Tight analysis of a self-approaching strategy for the online kernel-search problem (English)
0 references
16 June 2016
0 references
computational geometry
0 references
online algorithm
0 references
star-shaped polygon
0 references
