Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce a data structure supporting queries for the farthest distan...

Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce optimal data structures supporting queries for the farthest di...

6 Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph 7 with positive edge weights. We measure the distance between these points in terms of the weighted 8 shortest path distance, called the network distance. Within this metric space, we study farthest points 9 and farthest distances. We introduce optimal data structures supporting queries for the far...

We prove some results on the farthest points in convex metric spaces and in linear metric spaces. The continuity of the farthest point map and characterization of strictly convex linear metric spaces in terms of farthest points are also discussed.

In this paper, we consider the problem of farthest poinst for bounded sets in a real 2-normed spaces. We investigate some properties of farthest points in the setting of 2-normalised spaces and present various characterizations of b-farthest point of elements by bounded sets in terms of b-linear functional. We also provide some applications of farthest points in the setting of 2inner product sp...

In this paper, we consider the problem of the farthest poinst for bounded sets in a real 2-normed spaces. We investigate some properties of farthest points in the setting of 2-normalised spaces and present various characterizations of b-farthest point of elements by bounded sets in terms of b-linear functional. We also provide some applications of farthest points in the setting of 2inner produc...

in this paper we obtain a necessary and a sufficient condition for the set of ω_0-nearest points ( ω_0-farthest points) to be non-empty or a singleton set in normed linear spaces. we shall find a necessary and a sufficient condition for an uniquely remotal set to be a singleton set.