Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
31
click to vote
APPROX
2004
Springer
favorite
Email
discuss
report
119
views
Algorithms
»
more
APPROX 2004
»
Approximation Schemes for Broadcasting in Heterogenous Networks
14 years 4 months ago
Download
www.engr.uconn.edu
We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor has transmission time , which is the time taken to send a message to any other processor in the cluster. Previously,
Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger
Real-time Traffic
Algorithms
|
APPROX 2004
|
Broadcast Time
|
Transmission Time
|
claim paper
Post Info
More Details (n/a)
Added
30 Jun 2010
Updated
30 Jun 2010
Type
Conference
Year
2004
Where
APPROX
Authors
Samir Khuller, Yoo Ah Kim, Gerhard J. Woeginger
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision