Stochastic maximum weight forests
What is it about?
We discuss how to obtain connected acyclic components (a forest) maximizing the sum of their edge weights. The extra ingredient is that some edges have deterministic weight while others have uncertain weights in a given undirected graph.
Why is it important?
This work presents a correct understanding of the Martin's spanning tree polytope introduced in the 90's and extends his idea to forests.
The following have contributed to this page: Professor Rafael Castro de Andrade and Professor Abdel Lisser
In partnership with: