Allocating servers in infostations for bounded simultaneous requests (Q1886380)
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: Allocating servers in infostations for bounded simultaneous requests |
scientific article; zbMATH DE number 2116284
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Allocating servers in infostations for bounded simultaneous requests |
scientific article; zbMATH DE number 2116284 |
Statements
Allocating servers in infostations for bounded simultaneous requests (English)
0 references
18 November 2004
0 references
Infostations
0 references
Server allocation
0 references
Bin-packing
0 references
Greedy algorithms
0 references
Approximation algorithms
0 references
On-line algorithms
0 references
Interval coloring
0 references
0.8917436
0 references
0.8679932
0 references
0.8643781
0 references
0.8630539
0 references
0.86298794
0 references
0.8615443
0 references
0.8596827
0 references
