Sciweavers

Share
4 search results - page 1 / 1
» Maintaining a Minimum Spanning Tree Under Transient Node Fai...
Sort
View
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
10 years 6 months ago
Maintaining a Minimum Spanning Tree Under Transient Node Failures
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
Enrico Nardelli, Guido Proietti, Peter Widmayer
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
10 years 8 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suļ¬€ers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
11 years 2 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
books