SIGN IN
SIGN UP
Competitive routing of virtual circuits with unknown duration
Full Text:
PDF
Buy this Article
Authors:
Baruch Awerbuch
Lab. for Computer Science, MIT
Yossi Azar
Department of Computer Science, Tel Aviv University
Serge Plotkin
Department of Computer Science, Stanford University
Orli Waarts
IBM Almaden Research Center
1994 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 18
· Downloads (cumulative): 322
· Citation Count: 23
Published in:
· Proceeding
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Pages 321-327
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©1994
table of contents
ISBN:0-89871-329-3
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
routing and layout
theory
verification
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