Approximating Minimum Communication Cost Spanning Trees and Related Problems

@inproceedings{Reshef1999ApproximatingMC,
  title={Approximating Minimum Communication Cost Spanning Trees and Related Problems},
  author={Eilon Reshef},
  year={1999}
}
The problem of designing a communication network for a given set of requirements has been studied extensively in the literature, and many di erent variants of it were considered and given either exact solutions or heuristics. We consider the problem of minimum communication cost spanning trees (MCT), introduced in [18] and listed as [ND7] in [15] and [11]. This problem requires selecting a spanning tree of a network that minimizes the total cost of transmitting a given set of communication… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS