206 search results - page 10 / 42 » A distributed approximation algorithm for the minimum degree... |
123
Voted
SPAA
1998
ACM
15 years 8 months ago
1998
ACM
125
click to vote
SOFSEM
2007
Springer
15 years 9 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...
136
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
163
Voted
IEICET
2011
14 years 10 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
135
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...