| dc.creator | Candia-Vejar, A. | |
| dc.creator | Bravo-Azlan, H. | |
| dc.date | 2007-11-22T22:20:44Z | |
| dc.date | 2007-11-22T22:20:44Z | |
| dc.date | 2006 | |
| dc.date.accessioned | 2017-03-07T14:43:08Z | |
| dc.date.available | 2017-03-07T14:43:08Z | |
| dc.identifier | Discrete Applied Mathematics 154 (5): 730-737 | |
| dc.identifier | 0166-218X | |
| dc.identifier | http://dspace.utalca.cl/handle/1950/4063 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/371730 | |
| dc.description | Candia-Vejar, A. Department of Systems Engineering, Universidad de Talca, Merced 437, Curicó, Chile. | |
| dc.description | A study of the worst-case performance of Wong's heuristic for the Steiner problem in directed networks (SPDN) is presented in this paper.
SPDN is a classic combinatorial optimization problem having the status of a very difficult problem (-hard problem) and it is known as an optimization model for a broad class of problems in networks. Several exact and heuristic approaches have been designed for SPDN in the last twenty five years.
Some papers analyze theoretical and experimental behavior of heuristics for SPDN, specially for undirected networks, but none of these has studied the worst-case performance of Wong's heuristic. In this paper, we find a lower bound for that performance and show that this bound is consistent with comparable results in the literature on SPDN and its undirected version. | |
| dc.format | 2941 bytes | |
| dc.format | text/html | |
| dc.language | en | |
| dc.publisher | Elsevier B.V. | |
| dc.subject | Steiner problem; Wong's heuristic; Worst-case performance; Approximation algorithms | |
| dc.title | Worst-case performance of Wong's Steiner tree heuristic | |
| dc.type | Artículos de revistas | |
