Related papers: The minimum time function for the controlled Morea…
In this paper, we develop an inexact version of the catching-up algorithm for sweeping processes. We define a new notion of approximate projection, which is compatible with any numerical method for approximating exact projections, as this…
In this paper, we study the {\sc Dominating Set} problem in random graphs. In a random graph, each pair of vertices are joined by an edge with a probability of $p$, where $p$ is a positive constant less than $1$. We show that, given a…
We consider stochastic control with discretionary stopping for the drift of a diffusion process over an infinite time horizon. The objective is to choose a control process and a stopping time to minimize the expectation of a convex terminal…
Given a linear system, we consider the problem of finding a small set of variables to affect with an input so that the resulting system is controllable. We show that this problem is NP-hard; indeed, we show that even approximating the…
This paper concerns the study of a broad class of minimal time functions corresponding to control problems with constant convex dynamics and closed target sets in arbitrary Banach spaces. In contrast to other publications, we do not impose…
We develop a numerical method for the computation of a minimal convex and compact set, $\mathcal{B}\subset\mathbb{R}^N$, in the sense of mean width. This minimisation is constrained by the requirement that $\max_{b\in\mathcal{B}}\langle b ,…
We develop an approach for solving one-sided optimal stopping problems in discrete time for general underlying Markov processes on the real line. The main idea is to transform the problem into an auxiliary problem for the ladder height…
A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…
Given two points s and t in the plane and a set of obstacles defined by closed curves, what is the minimum number of obstacles touched by a path connecting s and t? This is a fundamental and well-studied problem arising naturally in…
In \cite{ CLEVACKTHI, CLEVACK} an attempt is made to find a comprehensive mathematical framework in which to investigate the problems of well-posedness, asymptotic analysis and parameter estimation for fully nonlinear evolutionary game…
In this paper, we discuss the general existence theory of Dirac-harmonic maps from closed surfaces via the heat flow for $\alpha$-Dirac-harmonic maps and blow-up analysis. More precisely, given any initial map along which the Dirac operator…
In this work, we follow the current trend on temporal graph realization, where one is given a property P and the goal is to determine whether there is a temporal graph, that is, a graph where the edge set changes over time, with property P…
Quasi-variational inequalities (QVIs) of obstacle type in many cases have multiple solutions that can be ordered. We study a multitude of properties of the operator mapping the source term to the minimal or maximal solution of such QVIs. We…
We study $n$-dimensional area-minimizing currents $T$ in $\mathbb{R}^{n+1},$ with boundary $\partial T$ satisfying two properties: $\partial T$ is locally a finite sum of $(n-1)$-dimensional $C^{1,\alpha}$ orientable submanifolds which only…
In this paper we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is…
In a graph $G$, a vertex subset $S\subseteq V(G)$ is said to be a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$. A dominating set $S$ of a graph $G$ is called a paired-dominating set if the induced subgraph…
The minimum dominating set problem asks for a dominating set with minimum size. First, we determine some vertices contained in the minimum dominating set of a graph. By applying a particular scheme, we ensure that the resulting graph is…
This paper investigates a minimal time control problem for the heat equation with multiple impulse controls. We first establish the maximum principles for this problem and then prove the equivalence between the minimal time impulse control…
We deal with finite dimensional linear and nonlinear control systems. If the system is linear and autonomous and satisfies the classical normality assumption, we improve the well known result on the strict convexity of the reachable set…
We consider the problem of damping a control system with delay, described by first-order functional-differential equations on a temporal star graph. The delay in the system is time-proportional and propagates through the internal vertex. We…