107 search results - page 2 / 22 » Prize-Collecting Steiner Network Problems |
LATIN
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
JUCS
2008
13 years 5 months ago
2008
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
COCOA
2008
Springer
13 years 7 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
CMSB
2009
Springer
13 years 12 months ago
2009
Springer
