We present a provably more efficient implementation of the Minimum Norm Point Algorithm conceived by Fujishige than the one presented in [FUJI06]. The algorithm solves the minimization problem for a class of functions known as submodular. Many important functions, such as minimum cut in the graph, have the so called submodular property [FUJI82]. It is known that the problem can also be efficien...

In this paper Theorem 3.1 of Kubiaczyk and Sushil Sharma [5] is shown to hold even under weaker hypothesis (Theorem 2.2) and we obtain a fixed point theorem (Theorem 2.3) involving occasionally weakly compatible maps and also prove a coincidence point theorem (Theorem 2.4) for a pair of self maps under certain conditions. Examples are provided to show that the hypothesis in Theorems 2.3 and 2.4...

By using a compatibility condition due to Jungck we establish some common fixed point theorems for four mappings on complete and compact metric spaces These results also generalize a theorem of Sharma and Sahu

The main result is a common fixed point theorem for a pair of multivalued maps on a complete metric space extending a recent result of D − orić and Lazović 2011 for a multivalued map on a metric space satisfying Ćirić-Suzuki-type-generalized contraction. Further, as a special case, we obtain a generalization of an important common fixed point theorem of Ćirić 1974 . Existence of a common soluti...

Probabilistic metric space was first introduced by Menger [6]. Later, there are many authors who have some detailed discussions and applications of a probabilistic metric space, for example, we may see Schweizer and Sklar [8]. Besides, there are many results about fixed point theorems in a probabilistic metric space with contractive types having appeared; we may see the papers [1–3, 9–12]. In t...

In this paper we prove common fixed point theorem for compatible mapping.