相关论文: Two-distance minimal dominating set problem studie…

We give a new, short proof that graphs embeddable in a given Euler genus-$g$ surface admit a simple $f(g)$-round $\alpha$-approximation distributed algorithm for Minimum Dominating Set (MDS), where the approximation ratio $\alpha \le 906$.…

We introduce a hierarchy of problems between the \textsc{Dominating Set} problem and the \textsc{Power Dominating Set} (PDS) problem called the $\ell$-round power dominating set ($\ell$-round PDS, for short) problem. For $\ell=1$, this is…

Locating source of diffusion in networks is crucial for controlling and preventing epidemic risks. It has been studied under various probabilistic models. In this paper, we study source location from a deterministic point of view by…

Let $G(V,E)$ be a simple, undirected and connected graph. A dominating set $S \subseteq V(G)$ is called a $2$-\textit{secure dominating set} ($2$-SDS) in $G$, if for every pair of distinct vertices $u_1,u_2 \in V(G)$ there exists a pair of…

The Minimum Dominating Set (MDS) problem is not only one of the most fundamental problems in distributed computing, it is also one of the most challenging ones. While it is well-known that minimum dominating sets cannot be approximated…

The dominating set problem has many practical applications but is well-known to be NP-hard. Therefore, there is a need for efficient approximation algorithms, especially in applications such as ad hoc wireless networks. Most distributed…

Spin-glass systems are universal models for representing many-body phenomena in statistical physics and computer science. High quality solutions of NP-hard combinatorial optimization problems can be encoded into low energy states of…

This thesis focuses on the XY model, the simplest vector spin model, used for describing numerous physical systems. It is studied for different sources of quenched disorder: random couplings, random fields, or both them. The belief…

We investigate thermodynamic phase transitions of the joint presence of spin glass (SG) and random field (RF) using a random graph model that allows us to deal with the quenched disorder. Therefore, the connectivity becomes a controllable…

Starting from a Cluster Variational Method, and inspired by the correctness of the paramagnetic Ansatz (at high temperatures in general, and at any temperature in the 2D Edwards-Anderson model) we propose a novel message passing algorithm…

To establish a unified framework for studying both discrete and continuous coupling distributions, we introduce the {\it binomial} spin glass, a class of models where the couplings are sums of $m$ identically distributed Bernoulli random…

In a complete bipartite graph with vertex sets of cardinalities $n$ and $m$, assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as $n\rightarrow\infty$, with $m = \lceil…

The Minimum Dominating Set (MDS) problem is a well-established combinatorial optimization problem with numerous real-world applications. Its NP-hard nature makes it increasingly difficult to obtain exact solutions as the graph size grows.…

Given a graph $G=(V,E)$, the dominating set problem asks for a minimum subset of vertices $D\subseteq V$ such that every vertex $u\in V\setminus D$ is adjacent to at least one vertex $v\in D$. That is, the set $D$ satisfies the condition…

We investigate graph problems in the following setting: we are given a graph $G$ and we are required to solve a problem on $G^2$. While we focus mostly on exploring this theme in the distributed CONGEST model, we show new results and…

Results regarding spin glass models are, to this day, mainly confined to models with Ising spins. Spin glass models with continuous spins exhibit interesting new physical behaviors related to the additional degrees of freedom, but have been…

Given a graph $G=(V,E)$ and an integer $k$, the Minimum Membership Dominating Set (MMDS) problem seeks to find a dominating set $S \subseteq V$ of $G$ such that for each $v \in V$, $|N[v] \cap S|$ is at most $k$. We investigate the…

We study ensemble-based graph-theoretical methods aiming to approximate the size of the minimum dominating set (MDS) in scale-free networks. We analyze both analytical upper bounds of dominating sets and numerical realizations for…

In this article, we study a variant of the minimum dominating set problem known as the minimum liar's dominating set (MLDS) problem. We prove that the MLDS problem is NP-hard in unit disk graphs. Next, we show that the recent sub-quadratic…

The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…