Sciweavers

701 search results - page 15 / 141
» An Ant Algorithm for the Steiner Tree Problem in Graphs
Sort
View
WG
2001
Springer
15 years 8 months ago
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem
Clemens Gröpl, Stefan Hougardy, Till Nierhoff...
JISE
2006
107views more  JISE 2006»
15 years 3 months ago
FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem
Ming-I Hsieh, Eric Hsiao-Kuang Wu, Meng-Feng Tsai
121
Voted
JCO
2008
117views more  JCO 2008»
15 years 3 months ago
Approximation algorithms for connected facility location problems
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
Mohammad Khairul Hasan, Hyunwoo Jung, Kyung-Yong C...