6. NASA wants to link N stations spread over the country using communication cha

Question

6. NASA wants to link N stations spread over the country using communication chan- nels. For every pair of stations, there is a badnwidth associated with the channel between them, which is known a priori. It (NASA) wants to select N -1 channels (the minimum possible) in such a way that all the stations are linked by the channels and the total bandwidth (defined as the sum of the individual bandwidths of the channels) is maximum. Give an efficient algorithm for this problem and determine its worst-case time complexity. (20 pts.)

Explanation / Answer

The problem is of Maximum spanning tree for which pseudocode is given below:

Pseudocode:

The above-given algorithm will find out the Mxximum spanning tree of a graph.

The running time of this algorithm will be O(n log n).

Related Questions

Navigate

• Browse (All)
• Browse 6
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.