Results 41 to 50 of about 1,232,920 (123)
A Tabu Search Algorithm for the Steiner Tree Problem.
, 2002 The Steiner Tree problem in graphs is an NP-hard problem having applications in many areas including telecommunication, distribution and transportation systems.
Kulkarni, Girish
core
A bicriterion Steiner tree problem on graph [PDF]
, 2003 This paper presents a formulation of bicriterion Steiner tree problem which is stated as a task of finding a Steiner tree with maximal capacity and minimal length. It is considered as a lexicographic multicriteria problem.
Stanojević, Milan +5 more
core +2 more sources
An Approximation Scheme for the Generalized Geometric Minimum Spanning Tree Problem with Grid Clustering [PDF]
This paper is concerned with a special case of the Generalized Minimum Spanning Tree Problem. The Generalized Minimum Spanning Tree Problem is de¯ned on an undirected graph, where the vertex set is partitioned into clusters, and non-negative costs are ...
Grigoriev,Alexander, Feremans,Corinne
core
The Steiner tree problem [PDF]
, 2017 The Steiner tree problem, named after a Swiss mathematician Jacob Steiner (1796–1863), is a problem that many mathematicians have been dealing with. His contribution, however, is unclear even to this day.
Prevc Mavrin, Darja
core
Exact algorithms for the Steiner tree problem [PDF]
, 2008 In this thesis, the exact algorithms for the Steiner tree problem have been investigated. The Dreyfus-Wagner algorithm is a well-known dynamic programming method for computing minimum Steiner trees in general weighted graphs in time O(3k), where k is the
Wang, Xinhui
core +2 more sources
Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem [PDF]
, 2008 Particle Swarm Optimization is an evolutionary method inspired by the social behaviour of individuals inside swarms in nature. Solutions of the problem are modelled as members of the swarm which fly in the solution space.
N. Mladenović +8 more
core +1 more source
The Steiner Ratio for the Obstacle-Avoiding Steiner Tree Problem [PDF]
, 2008 This thesis examines the (geometric) Steiner tree problem: Given a set of points P in the plane, find a shortest tree interconnecting all points in P, with the possibility of adding points outside P, called the Steiner points, as additional vertices of ...
Razaghpour, Mina
core
A Scoping Review of Genus Viscum: Biological and Chemical Aspects of Alcoholic Extracts. [PDF]
Plants (Basel), 2023 Melo MNO +6 more
europepmc +1 more source
The rainbow vertex-index of complementary graphs [PDF]
, 2015 A vertex-colored graph $G$ is \emph{rainbow vertex-connected} if two vertices are connected by a path whose internal vertices have distinct colors. The \emph{rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest
Ye, Chengfu +3 more
core
A comprehensive database of Nature-Inspired Algorithms. [PDF]
Data Brief, 2020 Tzanetos A, Fister I, Dounias G.
europepmc +1 more source