628 search results - page 21 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
105
click to vote
FLAIRS
2001
15 years 4 months ago
2001
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
133
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
136
click to vote
WDAG
2001
Springer
15 years 7 months ago
2001
Springer
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
151
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
120
click to vote
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )