Titlebook: Approximation and Online Algorithms; 10th International W Thomas Erlebach,Giuseppe Persiano Conference proceedings 2013 Springer-Verlag Ber

Generalize

WAG

O. Haxel,J. H. D. Jensen,H. E. Suesss in the plane as input. From each member of the set, one point must be selected, and the MST is computed over the set of selected points. We consider both minimizing and maximizing the weight of the MST over the input. The minimum weight version of the problem is known as the minimum spanning tree

昏迷状态