A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem (Q727979): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-016-0115-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-016-0115-1 / rank | |||
Normal rank | |||
Latest revision as of 02:14, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem |
scientific article |
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
