• Worst-case performance of Wong...

Treffer: Worst-case performance of Wong's Steiner tree heuristic

Title:
Worst-case performance of Wong's Steiner tree heuristic
Authors:
CANDIA-VEJAR, Alfredo, BRAVO-AZLAN, Hugo
Source:
IV ALIO/EURO Workshop on Applied Combinatorial Optimization, Pucón, Chile, November 4-6, 2002Discrete applied mathematics. 154(5):730-737
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 27 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Optimisation. Problèmes de recherche, Optimization. Search problems, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Approche heuristique, Heuristic approach, Enfoque heurístico, Borne inférieure, Lower bound, Cota inferior, Informatique théorique, Computer theory, Informática teórica, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Performance, Rendimiento, Arbre Steiner, Heuristique Wong, Wong heuristic, Pire cas, Problème Steiner, Approximation algorithms, Steiner problem, Wong's heuristic, Worst-case performance
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Systems Engineering, Universidad de Talca, Merced 437, Curicó, Chile
Department of Mathematics, Universidad de Tarapacá, Avda. Gral. Velásquez 1775, Arica, Chile
ISSN:
0166-218X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17635761
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics

Operational research. Management
Accession Number:
edscal.17635761
Database:
PASCAL Archive

Weitere Informationen

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 (N,Y-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.