666 search results - page 74 / 134 » New primal-dual algorithms for Steiner tree problems |
WOB
2004
13 years 10 months ago
2004
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
IJIT
2004
13 years 10 months ago
2004
A sequential decision problem, based on the task of identifying the species of trees given acoustic echo data collected from them, is considered with well-known stochastic classifi...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
AICCSA
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree tha...
ADC
2003
Springer
14 years 2 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...