1 paper
Daniel Hathcock, Guy Kortsarz, R. Ravi
We consider minimum time multicasting problems in directed and undirected graphs: given a root node and a subset of t terminal nodes, multicasting seeks to find the minimum numbe…