On exact triangle inequalities in (q1, q2)-quasimetric spaces

Author(s):  
Zukhra Zhukovskaya ◽  
Sergey Zhukovskiy ◽  
Richik Sengupta

For arbitrary (q1, q2) -quasimetric space, it is proved that there exists a function f, such that f -triangle inequality is more exact than any (q1, q2) -triangle inequality. It is shown that this function f is the least one in the set of all concave continuous functions g for which g -triangle inequality hold.

1982 ◽  
Vol 89 (2) ◽  
pp. 123-154 ◽  
Author(s):  
Amos Tversky ◽  
Itamar Gati
Keyword(s):  

2010 ◽  
Vol 47 (3) ◽  
pp. 289-298 ◽  
Author(s):  
Fadime Dirik ◽  
Oktay Duman ◽  
Kamil Demirci

In the present work, using the concept of A -statistical convergence for double real sequences, we obtain a statistical approximation theorem for sequences of positive linear operators defined on the space of all real valued B -continuous functions on a compact subset of the real line. Furthermore, we display an application which shows that our new result is stronger than its classical version.


2014 ◽  
Vol 13 (1) ◽  
pp. 4127-4145
Author(s):  
Madhushi Verma ◽  
Mukul Gupta ◽  
Bijeeta Pal ◽  
Prof. K. K. Shukla

Orienteering problem (OP) is an NP-Hard graph problem. The nodes of the graph are associated with scores or rewards and the edges with time delays. The goal is to obtain a Hamiltonian path connecting the two necessary check points, i.e. the source and the target along with a set of control points such that the total collected score is maximized within a specified time limit. OP finds application in several fields like logistics, transportation networks, tourism industry, etc. Most of the existing algorithms for OP can only be applied on complete graphs that satisfy the triangle inequality. Real-life scenario does not guarantee that there exists a direct link between all control point pairs or the triangle inequality is satisfied. To provide a more practical solution, we propose a stochastic greedy algorithm (RWS_OP) that uses the roulette wheel selectionmethod, does not require that the triangle inequality condition is satisfied and is capable of handling both complete as well as incomplete graphs. Based on several experiments on standard benchmark data we show that RWS_OP is faster, more efficient in terms of time budget utilization and achieves a better performance in terms of the total collected score ascompared to a recently reported algorithm for incomplete graphs.


2021 ◽  
Vol 7 (1) ◽  
pp. 88-99
Author(s):  
Zanyar A. Ameen

AbstractThe notions of almost somewhat near continuity of functions and near regularity of spaces are introduced. Some properties of almost somewhat nearly continuous functions and their connections are studied. At the end, it is shown that a one-to-one almost somewhat nearly continuous function f from a space X onto a space Y is somewhat nearly continuous if and only if the range of f is nearly regular.


Filomat ◽  
2017 ◽  
Vol 31 (11) ◽  
pp. 3593-3597
Author(s):  
Ravindra Bisht

Combining the approaches of functionals associated with h-concave functions and fixed point techniques, we study the existence and uniqueness of a solution for a class of nonlinear integral equation: x(t) = g1(t)-g2(t) + ? ?t,0 V1(t,s)h1(s,x(s))ds + ? ?T,0 V2(t,s)h2(s,x(s))ds; where C([0,T];R) denotes the space of all continuous functions on [0,T] equipped with the uniform metric and t?[0,T], ?,? are real numbers, g1, g2 ? C([0, T],R) and V1(t,s), V2(t,s), h1(t,s), h2(t,s) are continuous real-valued functions in [0,T]xR.


1995 ◽  
Vol 21 (1) ◽  
pp. 203
Author(s):  
Banaszewski
Keyword(s):  

1982 ◽  
Vol 8 (2) ◽  
pp. 455
Author(s):  
Akemann ◽  
Bruckner

1989 ◽  
Vol 15 (1) ◽  
pp. 13
Author(s):  
Ciesielski ◽  
Larson ◽  
Ostaszewski
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document