Minimum Spanning Tree under 2 constraints instead of just 1

Правка en2, от Impostor_Syndrome, 2022-04-10 12:24:19

Each edge — 'i' in the graph has two values associated with it — v1[i] and v2[i].
Let M be one of the possible Spanning Tree of the graph. Then define A = max(v1[i]'s for all the edges in ST) and B = max(v2[i]'s for all the edges in the ST).

Then for all the possible Spanning Trees of this graph find the minimum value of A + B.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Impostor_Syndrome 2022-04-10 12:33:08 8
en2 Английский Impostor_Syndrome 2022-04-10 12:24:19 26
en1 Английский Impostor_Syndrome 2022-04-09 22:54:22 392 Initial revision (published)