Search NASA⌕ Search

SEARCH · Search NASA

Results for “Steiner Tree problem”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

SCIP-Jack—a solver for STP and variants with parallelization extensions

The Steiner tree problem in graphs is a classical problem that commonly arises in practical applications as one of many variants. While often a strong relationship between different Steiner tree problem variants can be observed, solution approaches employed so far have been prevalently problem-specific. In contrast, this paper introduces a general-purpose solver that can be used to solve both the classical Steiner tree problem and many of its variants without modification. This versatility is achieved by transforming various problem variants into a general form and solving them by using a state-of-the-art MIP-framework. The result is a high-performance solver that can be employed in massively parallel environments and is capable of solving previously unsolved instances.

90C10↗

Regularity of Maximum Distance Minimizers

We study properties of sets having the minimum length (one-dimensional Hausdorff measure) in the class of closed connected sets Σ ⊂ ℝ{sup 2} satisfying the inequality max{sub yϵM} dist (y, Σ) ≤ r for a given compact set M ⊂ ℝ{sup 2} and given r > 0. Such sets play the role of the shortest possible pipelines arriving at a distance at most r to every point of M where M is the set of customers of the pipeline.In this paper, it is announced that every maximum distance minimizer is a union of finitely many curves having one-sided tangent lines at every point. This shows that a maximum distance minimizer is isotopic to a finite Steiner tree even for a “bad” compact set M, which distinguishes it from a solution of the Steiner problem (an example of a Steiner tree with infinitely many branching points can be found in a paper by Paolini, Stepanov, and Teplitskaya). Moreover, the angle between these lines at each point of a maximum distance minimizer is at least 2π/3. Also, we classify the behavior of a minimizer Σ in a neighborhood of any point of Σ. In fact, all the results are proved for a more general class of local minimizers.

97 MATHEMATICS AND COMPUTING↗