The Steiner Minimal Network for Convex Configurations.

J.H. Rubinstein; D.A. Thomas; T. Cole

Displaying similar documents to “The Steiner Minimal Network for Convex Configurations.”

A Décomposition Theorem on Euclidean Steiner Minimal Trees.

D.Z. Du, F.K. Hwang, G.D. Song, G.Y Ting (1988)

Discrete & computational geometry

Similarity:

Steiner Minimal Trees on Sets of Four Points.

D.Z. Du, F.K. Hwang, G.D. Song, G.Y Ting (1987)

Discrete & computational geometry

Similarity:

On the Number of Minimal 1-Steiner Trees.

B. Aronov, D. Eppstein, M. Bern (1994)

Discrete & computational geometry

Similarity:

Steiner Minimal Trees for Regular Polygons.

D.Z. Du, F.K. Hwang, J.F. Wenig (1987)

Discrete & computational geometry

Similarity:

Computational complexity of integrated models of network design and facility location.

Bhadury, J., Chandrasekharan, R., Gewali, L. (2000)

Southwest Journal of Pure and Applied Mathematics [electronic only]

Similarity:

Minimal trees and monophonic convexity

Jose Cáceres, Ortrud R. Oellermann, M. L. Puertas (2012)

Discussiones Mathematicae Graph Theory

Similarity:

Let V be a finite set and 𝓜 a collection of subsets of V. Then 𝓜 is an alignment of V if and only if 𝓜 is closed under taking intersections and contains both V and the empty set. If 𝓜 is an alignment of V, then the elements of 𝓜 are called convex sets and the pair (V,𝓜 ) is called an alignment or a convexity. If S ⊆ V, then the convex hull of S is the smallest convex set that contains S. Suppose X ∈ ℳ. Then x ∈ X is an extreme point for X if X∖{x} ∈ ℳ. A convex geometry on a finite...