3 search results - page 1 / 1 » An Inverse-Ackermann Style Lower Bound for the Online Minimu... |
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
CPC
2007
13 years 4 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...