The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 821 – 840 of 1040

Showing per page

Remarks on best approximation in R-trees

William Kirk, Bancha Panyanak (2009)

Annales UMCS, Mathematica

An R-tree is a geodesic space for which there is a unique arc joining any two of its points, and this arc is a metric segment. If X is a closed convex subset of an R-tree Y, and if T: X → 2Y is a multivalued mapping, then a point z for which [...] is called a point of best approximation. It is shown here that if T is an ε-semicontinuous mapping whose values are nonempty closed convex subsets of Y, and if T has at least two distinct points of best approximation, then T must have a fixed point. We...

Currently displaying 821 – 840 of 1040