SIGN IN
SIGN UP
The generalized two-server problem
Full Text:
Pdf
Buy this Article
Authors:
René A. Sitters
Max Planck Institute für Informatik, Saarbrücken, Germany
Leen Stougie
Technische Universiteit Eindhoven, and CWI, Amsterdam, The Netherlands
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 53 Issue 3, May 2006
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1147954.1147960
2006 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 25
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
k
-server problem
algorithms
competitive analysis
computations on discrete structures
metrical service system
on-line algorithms
theory
work function
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder