{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article6482","name":"Computing Minimum Spanning Trees with Uncertainty","abstract":"We consider the minimum spanning tree problem in a setting where\r\n information about the edge weights of the given graph is uncertain.\r\n Initially, for each edge $e$ of the graph only a set $A_e$, called\r\n an uncertainty area, that contains the actual edge weight\r\n $w_e$ is known. The algorithm can `update' $e$ to obtain the edge\r\n weight $w_e in A_e$. The task is to output the edge set of a\r\n minimum spanning tree after a minimum number of updates. An\r\n algorithm is $k$-update competitive if it makes at most $k$ times\r\n as many updates as the optimum. We present a $2$-update\r\n competitive algorithm if all areas $A_e$ are open or trivial, which\r\n is the best possible among deterministic algorithms. The condition\r\n on the areas $A_e$ is to exclude degenerate inputs for which no\r\n constant update competitive algorithm can exist.\r\n\r\n Next, we consider a setting where the vertices of the graph\r\n correspond to points in Euclidean space and the weight of an edge\r\n is equal to the distance of its endpoints. The location of each\r\n point is initially given as an uncertainty area, and an update\r\n reveals the exact location of the point. We give a general\r\n relation between the edge uncertainty and the vertex uncertainty\r\n versions of a problem and use it to derive a $4$-update competitive\r\n algorithm for the minimum spanning tree problem in the vertex\r\n uncertainty model. Again, we show that this is best possible among\r\n deterministic algorithms.","keywords":"Algorithms and data structures; Current challenges: mobile and net computing","author":[{"@type":"Person","name":"Hoffmann, Michael","givenName":"Michael","familyName":"Hoffmann"},{"@type":"Person","name":"Erlebach, Thomas","givenName":"Thomas","familyName":"Erlebach"},{"@type":"Person","name":"Krizanc, Danny","givenName":"Danny","familyName":"Krizanc"},{"@type":"Person","name":"Mihal'\u00e1k, Mat\u00fas","givenName":"Mat\u00fas","familyName":"Mihal'\u00e1k"},{"@type":"Person","name":"Raman, Rajeev","givenName":"Rajeev","familyName":"Raman"}],"position":25,"pageStart":277,"pageEnd":288,"dateCreated":"2008-02-06","datePublished":"2008-02-06","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by-nd\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Hoffmann, Michael","givenName":"Michael","familyName":"Hoffmann"},{"@type":"Person","name":"Erlebach, Thomas","givenName":"Thomas","familyName":"Erlebach"},{"@type":"Person","name":"Krizanc, Danny","givenName":"Danny","familyName":"Krizanc"},{"@type":"Person","name":"Mihal'\u00e1k, Mat\u00fas","givenName":"Mat\u00fas","familyName":"Mihal'\u00e1k"},{"@type":"Person","name":"Raman, Rajeev","givenName":"Rajeev","familyName":"Raman"}],"copyrightYear":"2008","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2008.1358","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6204","volumeNumber":1,"name":"25th International Symposium on Theoretical Aspects of Computer Science","dateCreated":"2008-02-05","datePublished":"2008-02-05","editor":[{"@type":"Person","name":"Albers, Susanne","givenName":"Susanne","familyName":"Albers"},{"@type":"Person","name":"Weil, Pascal","givenName":"Pascal","familyName":"Weil"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article6482","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6204"}}}