The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation algorithm has a performance ratio of 1.550. This is still far away from 1.0074, the largest known lower bound on the achievable performance ratio. As all instances resulting from known lower bound reductions are uniformly quasi-bipartite,...

In this paper, we present a paraconsistent description logic based on quasi-classical logic. Compared to the four-valued description logic, quasi-classical description logic satisfies all of the three basic inference rules (i.e., modus ponens, modus tollens and disjunctive syllogism) so that the inference ability of quasiclassical description logic is closer to that of classical logic. Quasicla...

In this paper, we construct a new iterative scheme by hybrid projection method and prove strong convergence theorems for approximation of a common element of set of common fixed points of an infinite family of asymptotically quasi-φ-nonexpansive mappings, set of solutions to a variational inequality problem and set of common solutions to a system of generalized mixed equilibrium problems in a u...

The dissociation of nitrogen was studied using a quasi-classical trajectory (QCT) analysis in the context of calculating the dissociation rate surface for a dense range of temperatures for use in computational fluid dynamics (CFD) applications. By sampling rovibrational states from a Boltzmann distribution but uniformly sampling the relative speed, the dissociation rate was calculated for trans...