1-Steiner tree problem
A minimum-labeling approach for reconstructing protein networks across multiple conditions
... = 1 we have L(f ) = N(f ), thus in this case the MKL problem is equivalent to the minimum directed Steiner tree ...= 1), which is equivalent to the union of independent Steiner ...
8
The power of dynamic distance oracles : efficient dynamic algorithms for the Steiner tree
... the Steiner tree, in particular the approach that combines online Steiner tree algorithm with a distance oracle, is highly ...better Steiner tree algorithms, but the vertex-color ...
75
An Improved Approximation Ratio for the Covering Steiner Problem
... a tree, since the notion of probabilistic tree embeddings [1] can be used to reduce an arbitrary instance of the problem to a instance on a ...on tree-instances implies an O(ρ log ...
12
The Minimum Steiner Tree Problem Based on Genetic Algorithm
... the problem to solve is how to design the laying cable line, making the network connected and the total length of the shortest ...v 1 *, ...weight tree T * in the graph ...
5
An Approximate Algorithm for the Steiner Tree Problem based on Ant Colony Algorithm
... Steiner tree problem is a classical NP-complete problem [1], which can be described as giving an undirected graph 𝐺 = (𝑉, 𝐸, 𝑐) where 𝑉 is the set of nodes in the graph, 𝐸 is the edge, ...
6
Separator-Based Pruned Dynamic Programming for Steiner Tree
... The Steiner tree problem has been extensively studied both theoretically and ...studies, Steiner tree is known as one of the Karp’s 21 NP-complete problems and has been studied from ...
8
A Hybrid Algorithm for Solving Steiner Tree Problem
... Fig 1: An example of the Steiner tree in grap h The Steiner tree problem is NP-hard even in Euclidean or rectilinear metrics ...the Steiner tree ...
7
The Relationship between R&D Investment and Dividend Payment Tax Incentives and Their Role in the Dividend Tax Puzzle
... QoSMT problem was introduced in the context of multimedia distribution over communication networks by Maxemchuk ...multicast tree in many prac- tical ...the Steiner tree ...of Steiner ...
60
A Tabu Search Algorithm for the Steiner Tree Problem.
... In this chapter we present the results of computational experiments performed to evaluate the effectiveness of the proposed algorithm on an empirical basis. Henceforth, we refer to the tabu search algorithm that we have ...
61
Deterministic Deployment of Wireless Sensor Networks
... when 1 -connectivity and minimum cost are the two com- peting ...the Steiner minimal tree problem, and proves to be much more accurate than the current best heuris- tics for the 1 ...
6
Particle swarm optimization for the Steiner tree in graph and delay constrained multicast routing problems
... [0, 1] is greater than the mapped velocity, the position takes value 0, otherwise it takes value ...salesman problem (Onwubolu and Clerc, 2004), production scheduling problems (Allahverdi and Al-Anzi, 2006; ...
20
Reduction techniques for the prize collecting Steiner tree problem and the maximum‐weight connected subgraph problem
... Another interesting aspect is the individual performance of the reduction tests. To this end, we have listed the results of running each test exclusively (until no more eliminations are possible) in Table 3. Before each ...
34
Some Steiner Symmetry Results in Overdetermined Boundary Value Problem
... See [4]. Recently there have been found several other new approaches in studying symmetry problem, such as continuous Steiner symmetrization, domain derivatives and some geometry method, see [5-9]. The ...
5
Problem Tree Analysis
... The Problem Tree Analysis belongs to the family of participatory planning techniques, in which all parties involved identify and analyse the needs ...
10
The Monotonic Cost Allocation Rule in Steiner Tree Network Games
... allocation problem as a cooperative game in characteristic function form, followed by the evaluation of various game theoretic solution concepts in the context of a particular ...spanning tree games [ 4 ] , ...
14
Converting Declarative Rules into Decision Trees
... decision tree method for learning a single decision tree that approximates the classification decision of a majority voting ...decision tree) and then a single decision tree is learned from ...
7
An Improved MPH Based Delay constrained Steiner Tree Algorithm
... multicast tree, thus reduc- ing the total cost of the multicast ...cast tree, but the calculation is too large, so it is difficult to apply to the ...costs tree, if the path’s delay destroys the ...
6
An ε-constraint multi-objective optimization model for web-based convergent product networks using the Steiner tree
... interest in multi-criteria decision making has contin- ually grown during the past decades, as attested by the number of books and surveys on the topic (e.g., see [32-35], among others). It comes as no surprise that more ...
16
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
Training Tree Transducers
... Section 1, we may consider strings as isomorphic to degener- ate, monadic-spined right-branching trees, for example, the string (a, b, c) is the tree C(a, C(b, C(c, ...a tree, but with END yielding ...
38