A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebra...
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
The explicit solution of the filtering problem with exponential criteria for a general Gaussian signal is obtained through an approach which is based on a conditional Cameron-Mart...