Sciweavers

672 search results - page 70 / 135
» Lower-stretch spanning trees
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
Broadcast Trees for Heterogeneous Platforms
In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in...
Olivier Beaumont, Loris Marchal, Yves Robert
LREC
2008
126views Education» more  LREC 2008»
13 years 10 months ago
Tree Distance and Some Other Variants of Evalb
Some alternatives to the standard evalb measures for parser evaluation are considered, principally the use of a tree-distance measure, which assigns a score to a linearity and anc...
Martin Emms
IPCO
2001
166views Optimization» more  IPCO 2001»
13 years 10 months ago
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
Fabián A. Chudak, Tim Roughgarden, David P....
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 2 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
GD
2006
Springer
14 years 16 days ago
Schematisation of Tree Drawings
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...
Joachim Gudmundsson, Marc J. van Kreveld, Damian M...