A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979)
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: A randomized O( n)-competitive algorithm for the online connected facility location problem |
scientific article; zbMATH DE number 6667669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem |
scientific article; zbMATH DE number 6667669 |
Statements
A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (English)
0 references
21 December 2016
0 references
online algorithms
0 references
competitive analysis
0 references
connected facility location
0 references
Steiner tree
0 references
approximation algorithms
0 references
randomized algorithms
0 references
0 references
0 references
0.9462012648582458
0 references
0.8655388355255127
0 references
0.8157713413238525
0 references
0.7893799543380737
0 references
