Efficient approximations for the online dispersion problem (Q4634023)
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 7051392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient approximations for the online dispersion problem |
scientific article; zbMATH DE number 7051392 |
Statements
Efficient Approximations for the Online Dispersion Problem (English)
0 references
7 May 2019
0 references
geometric optimization
0 references
dispersion
0 references
packing
0 references
online algorithms
0 references
competitive ratio
0 references
0 references
0.9969225525856018
0 references
0.836654007434845
0 references
0.801070511341095
0 references
0.801070511341095
0 references
0.8009702563285828
0 references