628 search results - page 2 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
IPPS
2003
IEEE
14 years 4 months ago
2003
IEEE
ALGORITHMICA
2004
13 years 10 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
SODA
2004
ACM
14 years 7 days ago
2004
ACM
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
AAIM
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
CCCG
2007
14 years 9 days ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...