منابع مشابه
Constrained Steiner trees in Halin graphs
In this paper, we study the problem of computing a minimum cost Steiner tree subject to a weight constraint in a Halin graph where each edge has a nonnegative integer cost and a nonnegative integer weight. We prove the NP-hardness of this problem and present a fully polynomial time approximation scheme for this NP-hard problem.
متن کاملSteiner Problem in Multistage Computer Networks
Multistage computer networks are popular in parallel architectures and com munication applications We consider the message communication problem for the two types of multistage networks one popular for parallel architectures and the other popular for communication networks A subset of the problem can be equated to the Steiner tree problem for multistage graphs Inherent complexities of the probl...
متن کاملAlgorithms for the Steiner problem in networks
The Steiner problem in networks is the problem of connecting a set of required vertices in a weighted graph at minimum cost. It is a classical NP-hard problem with many important applications. For this problem we develop, implement and test several new techniques. On the side of lower bounds, we present a hierarchy of linear relaxations and class of new relaxations that are the currently strong...
متن کاملA Parallel Genetic Algorithm for the Steiner Problem in Networks
This paper presents a parallel genetic algorithm to the Steiner Problem in Networks. Several previous papers have proposed the adoption of GAs and others metaheuristics to solve the SPN demonstrating the validity of their approaches. This work differs from them for two main reasons: the dimension and the characteristics of the networks adopted in the experiments and the aim from which it has be...
متن کاملAlgorithmic approaches to the Steiner problem in networks
The Steiner problem in networks is the problem of connecting a set of required vertices in a weighted graph at minimum cost. This is a classical NP-hard problem and a fundamental problem in network design with many practical applications. We approach this problem by different means: Relaxations, which relax the feasibility constraints, to get close to an optimal solution; heuristics to find goo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1987
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90031-x