SIGN IN
SIGN UP
Improved bandwidth approximation for trees
Full Text:
PDF
Buy this Article
Author:
Anupam Gupta
Computer Science Division, University of California, Berkeley, CA
Published in:
· Proceeding
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Pages 788-793
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2000
table of contents
ISBN:0-89871-453-2
2000 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 279
· Citation Count: 4
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
design
linear approximation
linear systems
measurement
performance
theory
trees
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