Minimum Spanning Tree Verification Under Uncertainty

  • Thomas Erlebach
  • Michael HoffmannEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8747)


In the verification under uncertainty setting, an algorithm is given, for each input item, an uncertainty area that is guaranteed to contain the exact input value, as well as an assumed input value. An update of an input item reveals its exact value. If the exact value is equal to the assumed value, we say that the update verifies the assumed value. We consider verification under uncertainty for the minimum spanning tree (MST) problem for undirected weighted graphs, where each edge is associated with an uncertainty area and an assumed edge weight. The objective of an algorithm is to compute the smallest set of updates with the property that, if the updates of all edges in the set verify their assumed weights, the edge set of an MST can be computed. We give a polynomial-time optimal algorithm for the MST verification problem by relating the choices of updates to vertex covers in a bipartite auxiliary graph. Furthermore, we consider an alternative uncertainty setting where the vertices are embedded in the plane, the weight of an edge is the Euclidean distance between the endpoints of the edge, and the uncertainty is about the location of the vertices. An update of a vertex yields the exact location of that vertex. We prove that the MST verification problem in this vertex uncertainty setting is NP-hard. This shows a surprising difference in complexity between the edge and vertex uncertainty settings of the MST verification problem.


Bipartite Graph Planar Graph Minimum Span Tree Online Algorithm Vertex Cover 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



The second author would like to thank the University of Leicester for supporting this research in granting him academic study leave.


  1. 1.
    Bruce, R., Hoffmann, M., Krizanc, D., Raman, R.: Efficient update strategies for geometric computing with uncertainty. Theor. Comput. Syst. 38(4), 411–423 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Erlebach, T., Hoffmann, M., Krizanc, D., Mihalák, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: Albers, S., Weil, P. (eds.) STACS. LIPIcs, vol. 1, pp. 277–288. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)Google Scholar
  3. 3.
    Feder, T., Motwani, R., O’Callaghan, L., Olston, C., Panigrahy, R.: Computing shortest paths with uncertainty. J. Algorithms 62(1), 1–18 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Feder, T., Motwani, R., Panigrahy, R., Olston, C., Widom, J.: Computing the median with uncertainty. SIAM J. Comput. 32(2), 538–547 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Garey, M., Johnson, D.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826–834 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Gupta, M., Sabharwal, Y., Sen, S.: The update complexity of selection and related problems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). LIPIcs, vol. 13, pp. 325–338. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2011)Google Scholar
  7. 7.
    Kahan, S.: A model for data in motion. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC’91), pp. 267–277 (1991)Google Scholar
  8. 8.
    Kamousi, P., Chan, T.M., Suri, S.: Stochastic minimum spanning trees in Euclidean spaces. In: Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG’11), pp. 65–74. ACM (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of LeicesterLeicesterUK

Personalised recommendations