Sciweavers

826 search results - page 166 / 166
» The Modernization of a Call Center
Sort
View
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
11 years 10 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...