Sciweavers

326 search results - page 21 / 66
» The Minimum-Area Spanning Tree Problem
Sort
View
ISMIR
2005
Springer
152views Music» more  ISMIR 2005»
14 years 2 months ago
ATTA: Automatic Time-Span Tree Analyzer Based on Extended GTTM
This paper describes a music analyzing system called the automatic time-span tree analyzer (ATTA), which we have developed. The ATTA derives a time-span tree that assigns a hierar...
Masatoshi Hamanaka, Keiji Hirata, Satoshi Tojo
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
14 years 2 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...
PDCAT
2005
Springer
14 years 2 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
OPODIS
2001
13 years 10 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 8 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich