Minimum Global Latency

Problem Statement

Minimum Global Latency Problem Description As the network administrator in your company, you wish to divide the data centers into optimal local regions. The data centers are represented by a connected graph, whose edges are bidirectional and weighted. An edge represents a network connection between two data centers. The edge weight corresponds to the latency of the connection. The global latency of a network is the biggest weight of its edges. You can remove any connections in the initial network, dividing it into isolated sub-networks, as long as the number of sub-networks does not exceed the parameter k . The global latency of a set of sub-networks is the biggest weight of all the edges of all the sub-networks. You must return the minimum possible value of the global latency that can be obtained, when removing connections while respecting the above constraint. The parameter nb_nodes corresponds to the total number of data centers. They are identified by an integer between 0 and nb_no