Title of article
Performance Analysis of Algorithms for the Steiner Problem in Directed Networks
Author/Authors
Alfredo Candia-Véjar، نويسنده , , Alfredo and Bravo-Azlلn، نويسنده , , Hugo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
6
From page
67
To page
72
Abstract
The Steiner problem in directed networks asks for the minimum total weight directed tree spanning a group of nodes of a directed and arc-weighted network. We analize the worst-case performance of several algorithms for this problem and also we discuss the comparability problem between these algorithms.
rmore, the empirical performance of a proposed hybrid approach is analized for some instances from the simple location problem.
Keywords
The Steiner problem in directed networks , approximation algorithms , Wong´s heuristic , comparability algorithms , Simulated annealing algorithm
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2004
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453756
Link To Document