Title of article
Worst-case performance of Wongʹs Steiner tree heuristic Original Research Article
Author/Authors
Alfredo Candia-Véjar، نويسنده , , Hugo Bravo-Azl?n، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
8
From page
730
To page
737
Abstract
A study of the worst-case performance of Wongʹs heuristic for the Steiner problem in directed networks (SPDN) is presented in this paper.
Keywords
Wongיs heuristic , Approximation algorithms , Worst-case performance , Steiner problem
Journal title
Discrete Applied Mathematics
Serial Year
2006
Journal title
Discrete Applied Mathematics
Record number
886234
Link To Document