Abstract This article studies the Minimum Spanning Tree Problem under Explorable Uncertainty as well as a related vertex uncertainty version of the problem. We particularly consider special instance types, including cactus graphs, for which we provide randomized algorithms. We introduce the problem of finding a minimum weight spanning star under uncertainty for which we show that no algorithm can achieve constant competitive ratio.

If a graph G can be represented by means of paths on a grid, such that each vertex of G corresponds to one path on the grid and two vertices of G are adjacent if and only if the corresponding paths share a grid edge, then this graph is called EPG and the representation is called EPG representation. A k-bend EPG representation is an EPG representation in which each path has at most k bends. The class of all graphs that have a k-bend EPG representation is denoted by Bk. Bℓm is the class of all graphs that have a monotonic ℓ-bend EPG representation, i.e. an ℓ-bend EPG representation, where each path is ascending in both columns and rows. It is trivial that Bkm⊆Bk for all k. Moreover, it is known that Bkm⫋Bk, for k=1. By investigating the Bk-membership and the Bkm-membership of complete bipartite graphs we prove that the inclusion is also proper for k∈{2,3,5} and for k⩾7. In particular, we derive necessary conditions for this membership that have to be fulfilled by m, n and k, where m and n are the number of vertices on the two partition classes of the bipartite graph. We conjecture that Bkm⫋Bk holds also for k∈{4,6}. Furthermore, we show that Bk⁄⊆B2k−9m holds for all k⩾5. This implies that restricting the shape of the paths can lead to a significant increase of the number of bends needed in an EPG representation. So far no bounds on the amount of that increase were known. We prove that B1⊆B3m holds, providing the first result of this kind.