We provide an optimized design solution, called Lagrangian Fast Marching (LAFM), for the
most popular submarine cable system topology (trunk-and-branch), on the undersea surface …

Abstract The Euclidean Steiner problem is considered and some related problems are
defined together with the historical background and aspects of these problems. A special …

Some of the most efficient heuristics for the Euclidean Steiner minimal tree problem in the d-
dimensional space, d ≥ 2 d≥ 2, use Delaunay tessellations and minimum spanning trees to …

One of the most important issues in deep learning is the need for huge corpus of training
samples to achieving desired results. Otherwise, any powerful model will overfit the training …

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 …

Some of the most efficient heuristics for the Euclidean Steiner minimal trees in the d-
dimensional space, d≥ 2, use Delaunay tessellations and minimum spanning trees to …