599 search results - page 18 / 120 » The repeater tree construction problem |
169
click to vote
DISOPT
2011
14 years 4 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
DAC
1989
ACM
15 years 1 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
127
click to vote
SOICT
2010
14 years 4 months ago
2010
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
104
click to vote
SIAMSC
2010
14 years 8 months ago
2010
A greedy algorithm for the construction of a reduced model with reduction in both parameter and state is developed for efficient solution of statistical inverse problems governed b...