982 search results - page 40 / 197 » Solving Steiner tree problems in graphs to optimality |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
IPL
2006
14 years 10 months ago
2006
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
101
click to vote
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...