@inproceedings{35832dcf663442d0883276ca581fee80,

title = "Approximation schemes for broadcasting in heterogeneous networks",

abstract = "We study the problem of minimizing the broadcast time for a set of processors in a cluster, where processor p i has transmission time t i , which is the time taken to send a message to any other processor in the cluster. Previously, it was shown that the Fastest Node First method (FNF) gives a 1.5 approximate solution. In this paper we show that there is a polynomial time approximation scheme for the problems of broadcasting and multicasting in such a heterogenous cluster.",

author = "S. Khuller and Y.-A. Kim and G.J. Woeginger",

year = "2004",

doi = "10.1007/978-3-540-27821-4_15",

language = "English",

isbn = "978-3-540-22894-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "163--170",

editor = "K. Jansen and {et al.}, xx",

booktitle = "Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (Proceedings APPROX 2004 and RANDOM 2004, Cambridge MA, USA, August 22-24, 2004)",

address = "Germany",

}