SIGN IN
SIGN UP
Approximation and heuristic algorithms for minimum-delay application-layer multicast trees
Full Text:
PDF
Buy this Article
Authors:
Eli Brosh
Computer Science Department, Columbia University, New York, NY
Asaf Levin
Department of Statistics, Hebrew University of Jerusalem, Jerusalem, Israel
Yuval Shavitt
School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel
Published in:
· Journal
IEEE/ACM Transactions on Networking (TON)
archive
Volume 15 Issue 2, April 2007
Pages 473-484
IEEE Press
Piscataway, NJ
, USA
table of contents
doi>
10.1109/TNET.2007.892840
2007 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 406
· Citation Count: 2
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
approximation algorithms
design
heuristic methods
overlay networks
path and circuit problems
peer-to-peer communications
routing protocols
trees
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