Evolutionary Approach to the Euclidean Steiner Tree Problem in n-Space by Michał Bereta

“…This article presents the application of a genetic algorithm for solving the Euclidean Steiner problem in spaces of dimensionality greater than 2. …”
Get full text

Degree-Constrained Steiner Problem in Graphs with Capacity Constraints by Miklos Molnar

Subjects: Get full text

Multi-layer obstacle-avoiding rectilinear steiner minimal tree algorithm based on deep reinforcement learning by Xing Huang, Yuhan Zhu, Yanbo Xu, Yajun Xie, Genggeng Liu

“…This makes the Multi-Layer Obstacle-Avoiding Rectilinear Steiner Minimal Tree (ML-OARSMT) problem highly challenging in VLSI physical design. …”
Get full text

Harigeeta: Cic Mechanism with Euclidean Steiner Tree for Service Latency Prediction in Delay-Sensitive Cloud Services by Rahul Kumar Sharma, Sarvpal Singh

“…This article presents an online latency prediction approach for VMs to improve load balancing. A Euclidean Circle Steiner Tree point is proposed. Results show compression with existing mechanisms and get 8-12 % more accuracy in latency prediction.…”
Get full text

Inbound traffic capture link-design problem independent of assumptions on users’ route choices by Ruri Sase, Satoshi Sugiura

Subjects: Get full text

Heuristic method for relay node placement in heterogeneous wireless network by Eliott Guffens, Vincent Le Nir, Ben Lauwens, Mathias Becquaert

Get full text

Minimum Link Flow Problem and Its Solution With Sparse Modeling by Ryotaro Matsuo, Ryo Nakamura, Hiroyuki Ohsaki

“…In this study, we examine how sparse modeling can be applied to solve a new network flow problem called minimum link flow problem. The minimum link flow problem, which includes problems such as the minimum cost flow problem and the minimum Steiner tree problem under certain conditions, is a combinatorial optimization problem, and to the best of our knowledge, no effective solution has been proposed for the minimum link flow problem. …”
Get full text

On the origin of the treponematoses: a phylogenetic approach. by Kristin N Harper, Paolo S Ocampo, Bret M Steiner, Robert W George, Michael S Silverman, Shelly Bolotin, Allan Pillay, Nigel J Saunders, George J Armelagos

Get full text

Variable-dimension swarm meta-heuristic for the optimal placement of relay nodes in wireless sensor networks by Yi-Han Xu, Wan-Guo Jiao, Yin Wu, Jun Song

“…The problem is formulated as a Steiner tree problem with minimum Steiner points and a bounded edge length problem, which is NP-hard. …”
Get full text

Many-to-Many Multicast Routing Schemes under a Fixed Topology by Wei Ding, Hongfa Wang, Xuerui Wei

“…In this case, the multicast tree appears as a terminal Steiner tree (TeST). The problem of finding a TeST with a quality-of-service (QoS) optimization is frequently NP-hard. …”
Get full text

Connectivity Recovery Based on Boundary Nodes and Spatial Triangle Fermat Points for Three-Dimensional Wireless Sensor Networks by Hongsheng Chen, Ke Shi

“…Based on this formula, the spatial triangle Fermat point algorithm constructs a Steiner tree to restore network connectivity. Extensive simulation experiments demonstrate that our proposed algorithms perform better than the existing algorithm.…”
Get full text