Sciweavers

Share
283 search results - page 2 / 57
» The saga of minimum spanning trees
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
9 years 5 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
CCCG
2006
9 years 7 months ago
Realization of Degree 10 Minimum Spanning Trees in 3-Space
We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.
James A. King
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
9 years 9 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
SODA
2004
ACM
156views Algorithms» more  SODA 2004»
9 years 7 months ago
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
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...
Yuval Emek, David Peleg
CATS
2007
9 years 7 months ago
Computing a Minimum-Dilation Spanning Tree is NP-hard
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and ...
Otfried Cheong, Herman J. Haverkort, Mira Lee
books