Sciweavers

Share
252 search results - page 1 / 51
» Degree Bounded Spanning Trees
Sort
View
GC
2010
Springer
9 years 9 months ago
Degree Bounded Spanning Trees
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
Jun Fujisawa, Hajime Matsumura, Tomoki Yamashita
FOCS
2006
IEEE
10 years 4 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
10 years 10 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau
FSTTCS
2007
Springer
10 years 4 months ago
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b  2. The aim is to nd a minimum weight spannin...
Anand Srivastav, Sören Werth
ALGORITHMICA
2004
153views more  ALGORITHMICA 2004»
9 years 10 months ago
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
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...
Jochen Könemann, Asaf Levin, Amitabh Sinha
books