Related papers: A Cross Entropy Approach to the Domination Problem…
Hub Covering Problems arise in various practical domains, such as urban planning, cargo delivery systems, airline networks, telecommunication network design, and e-mobility. The task is to select a set of hubs that enable tours between…
We consider a distributionally robust second-order stochastic dominance constrained optimization problem. We require the dominance constraints hold with respect to all probability distributions in a Wasserstein ball centered at the…
In this paper, we propose to study on sufficient control of complex networks which is to control a sufficiently large portion of the network, where only the quantity of controllable nodes matters. To the best of our knowledge, this is the…
A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…
The relaxed maximum entropy problem is concerned with finding a probability distribution on a finite set that minimizes the relative entropy to a given prior distribution, while satisfying relaxed max-norm constraints with respect to a…
Let G be a finite undirected graph. A vertex dominates itself and all its neighbors in G. A vertex set D is an efficient dominating set (e.d. for short) of G if every vertex of G is dominated by exactly one vertex of D. The Efficient…
Combinatorial Optimisation problems arise in several application domains and are often formulated in terms of graphs. Many of these problems are NP-hard, but exact solutions are not always needed. Several heuristics have been developed to…
We propose and analyze a one-dimensional multi-species cross-diffusion system with non-zero-flux boundary conditions on a moving domain, motivated by the mod- eling of a Physical Vapor Deposition process. Using the boundedness by entropy…
We use the method of Maximum (relative) Entropy to process information in the form of observed data and moment constraints. The generic "canonical" form of the posterior distribution for the problem of simultaneous updating with data and…
Different types of domination on the Sierpi\'nski graphs S(K_n,t) will be studied in this paper. More precisely, we propose a minimal dominating set for S(K_n,t) so that the exact values of their domination numbers, Roman domination…
We consider the problem of estimating a probability distribution that maximizes the entropy while satisfying a finite number of moment constraints, possibly corrupted by noise. Based on duality of convex programming, we present a novel…
A dominating set $S$ of a graph $G(V,E)$ is called a \textit{secure dominating set} if each vertex $u \in V(G) \setminus S$ is adjacent to a vertex $v \in S$ such that $(S \setminus \{v\}) \cup \{u\}$ is a dominating set of $G$. The…
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…
Inspired by graph domination games, various domination-type vertex sequences have been introduced, including the Grundy double dominating sequence (GDDS) of a graph and its associated parameter, the Grundy double domination number (GDDN).…
For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets $\sigma,\rho$ of non-negative integers, a $(\sigma,\rho)$-set of a graph $G$ is a…
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets of an interval or a permutation graph. In these problems, one asks to find a subset of vertices, normally called a…
The key issue in importance sampling is the choice of the alternative sampling distribution, which is often chosen from the exponential tilt family of the underlying distribution. However, when the problem exhibits certain kind of…
The rigorous asymptotics from reaction-cross-diffusion systems for three species with known entropy to cross-diffusion systems for two variables is investigated. The equations are studied in a bounded domain with no-flux boundary…
We address the challenge of exploration in reinforcement learning (RL) when the agent operates in an unknown environment with sparse or no rewards. In this work, we study the maximum entropy exploration problem of two different types. The…
The power domination number arises from the monitoring of electrical networks and its determination is an important problem. Upper bounds for power domination numbers can be obtained by constructions. Lower bounds for the power domination…