Tight analysis of a self-approaching strategy for the online kernel-search problem (Q294606)
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: Tight analysis of a self-approaching strategy for the online kernel-search problem |
scientific article; zbMATH DE number 6594014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight analysis of a self-approaching strategy for the online kernel-search problem |
scientific article; zbMATH DE number 6594014 |
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
0.7413011789321899
0 references
0.7350049614906311
0 references
0.7189556360244751
0 references
0.7148028612136841
0 references
