Steiner Tree
Separator-Based Pruned Dynamic Programming for Steiner Tree
... minimum Steiner tree for terminals S ∪ {u} for every subset S ⊆ A and every vertex u ∈ V in a bottom- up from small to large by using the dynamic programming ...the Steiner tree with k ...
8
An Approximate Algorithm for the Steiner Tree Problem based on Ant Colony Algorithm
... Ant colony optimization (ACO) is a well-known heuristic intelligent method which is used to solve combinatorial optimization problem and can obtain high-quality results in a reasonable execution time. Steiner ...
6
The Monotonic Cost Allocation Rule in Steiner Tree Network Games
... the Steiner tree problem is computation- ally complex and since the Steiner Tree Net- work (STN) game might have an empty core, it seems reasonable to look for the solutions that have other ...
14
The power of dynamic distance oracles : efficient dynamic algorithms for the Steiner tree
... The remainder of the paper is organized as follows. Section 2 introduces the notation and recalls some results used further in the paper. In Section 3 we describe a shortened version of our results, which is supposed to ...
75
The Minimum Steiner Tree Problem Based on Genetic Algorithm
... minimum Steiner tree by using genetic ...spanning tree and minimum Steiner tree ...minimum Steiner tree in detail and gave one ...
5
Reduction techniques for the prize collecting Steiner tree problem and the maximum‐weight connected subgraph problem
... prize-collecting Steiner tree problem, and the rooted prize-collecting Steiner tree problem that surpasses existing approaches for all three ...the Steiner tree problem in graphs ...
34
An Improved MPH Based Delay constrained Steiner Tree Algorithm
... delay-constrained Steiner tree problem is ...delay-constrained Steiner tree algorithm is presented in this ...multicast tree by selecting the path whose cost is the least; if the path’s ...
6
IMPLEMENTATION OF SHORTEST PATH ALGORITHM FOR RECTILINEAR STEINER TREE PROBLEM
... rectilinear Steiner minimum tree (RSMT) problem is one of the fundamental problems in physical design, especially in routing, which is known to be NP- ...rectilinear Steiner Tree problem and ...
12
A Tabu Search Algorithm for the Steiner Tree Problem.
... and size of the problem. For the proposed algorithm, some computational experiments were conducted to try and determine the value of the Tabu tenure for a given problem size. The size of the problem is based on the ...
61
Particle swarm optimization for the Steiner tree in graph and delay constrained multicast routing problems
... underlying Steiner tree ...the tree are carried out on selected paths within particle moves to reduce the cost of the ...the Steiner tree problem, we assess the efficiency and ...
20
A Hybrid Algorithm for Solving Steiner Tree Problem
... multicast tree connecting the members of the multicast group. This multicast tree is rooted at the source node and spans all destination nodes such that the communication cost becomes ...is Steiner ...
7
Connectivity problems on heterogeneous graphs
... the Steiner Network ...Prize-Collecting Steiner Tree model, where the input is a network G along with a penalty function, p(v) for each protein (node) in the network (based on their impor- tance; ...
17
Near-Optimal Network Design with Selfish Agents
... spanning tree, which is a 2-approximate budget balanced mechanism for the Steiner tree ...traditional Steiner tree cost-sharing methods do not lead to a Nash equilibrium, such a ...
33
The connected facility location polytope
... This article analyzes the polytope defined by the feasible solutions of the connected facility location problem. This problem combines the uncapacitated facility location problem and the Steiner tree ...
36
Vol 9, No 4 (2018)
... the Steiner distance d(W) of W is the minimum size of a connected subgraph of G containing ...a tree and is called a Steiner tree with respect to W or a Steiner W - ...a Steiner ...
5
On Steiner Domination Number of Graphs
... the Steiner distance d(W) ofW is the minimum size of a connected sub graph of G containing ...a tree and is called a Steiner tree with respect to W or aSteiner ...some Steiner ...
5
SCIP Jack A solver for STP and variants with parallelization extensions
... The improvement heuristic VQ is a combination of the three local search heuristics vertex insertion, key-path exchange, and key-vertex elimination as described in [23]. The basic idea of vertex insertion (denoted by V) ...
47
Evaluation of multicast routing algorithms for distributed real-time applications
... We study one unconstrained minimum Steiner tree algorithm, one unconstrained shortest paths algorithm, and three constrained MC routing heuristics that have been designed specifically fo[r] ...
13
The Relationship between R&D Investment and Dividend Payment Tax Incentives and Their Role in the Dividend Tax Puzzle
... The QoSMT problem was introduced in the context of multimedia distribution over communication networks by Maxemchuk [14]. Maxemchuk suggested a low- complexity heuristic which can be used to build reliable multicast ...
60
CLAIO 2018 MPPCSTBC
... the Steiner tree problem that directed GSECs dominate directed counterparts of several other facet defining inequalities of the undirected (GSEC) ...
8