Related papers: A Simulated Annealing-Based Multiobjective Optimiz…
Given a graph, the minimum dominating set (MinDS) problem is to identify a smallest set $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$. The MinDS problem is a classic $\mathcal{NP}$-hard problem…
We consider a connected undirected graph $G(n,m)$ with $n$ nodes and $m$ edges. A $k$-dominating set $D$ in $G$ is a set of nodes having the property that every node in $G$ is at most $k$ edges away from at least one node in $D$. Finding a…
Decentralized optimization methods have been in the focus of optimization community due to their scalability, increasing popularity of parallel algorithms and many applications. In this work, we study saddle point problems of sum type,…
With accelerating urbanization and worsening traffic congestion, optimizing traffic signal systems to improve road throughput and alleviate congestion has become a critical issue. This study proposes a short-term traffic prediction model…
We consider network design problems in which we are given a graph and seek a min-size $2$-connected subgraph that satisfies a prescribed property. $\bullet$ In the 1-Connectivity Augmentation problem the goal is to augment a connected graph…
A {\em dominating set} of a graph $G=(V,E)$ is a subset of vertices $S\subseteq V$ such that every vertex $v\in V\setminus S$ has at least one neighbor in $S$. Finding a dominating set with the minimum cardinality in a connected graph…
The selection of nodes that can serve as cluster heads, local sinks and gateways is a critical challenge in distributed sensor and communication networks. This paper presents a novel framework for identifying a minimal set of nexus nodes to…
The greedy algorithm for approximating dominating sets is a simple method that is known to compute an $(\ln n+1)$-approximation of a minimum dominating set on any graph with $n$ vertices. We show that a small modification of the greedy…
In this study, a nondominated-solution-based multi-objective greedy method is proposed and applied to a sensor selection problem based on the multiple indices of the optimal design of experiments. The proposed method simultaneously…
We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent LP rounding algorithms and a hybrid algorithm…
In this paper, we propose an algorithm based on the Alternating Minimization technique to solve the uplink massive MIMO detection problem. The proposed algorithm provides a lower complexity compared to the conventional MMSE detection…
We investigate parameterized algorithms for the NP-hard problem Min-Power Asymmetric Connectivity (MinPAC) that has applications in wireless sensor networks. Given a directed arc-weighted graph, MinPAC asks for a strongly connected spanning…
The transmission switching problem aims to determine the optimal network topology that minimizes the operating costs of a power system. This problem is typically formulated as a mixed-integer optimization model, which involves big-M…
In this paper, we aim to solve a distributed optimization problem with affine coupling constraints in a multi-agent network, where the cost function of the agents is composed of smooth and possibly non-smooth parts. To solve this problem,…
The problem of maximizing weighted sum rates in the downlink of a multicell environment is of considerable interest. Unfortunately, this problem is known to be NP-hard. For the case of multi-antenna base stations and single antenna mobile…
In this paper we consider a distributed optimization scenario in which a set of processors aims at minimizing the maximum of a collection of "separable convex functions" subject to local constraints. This set-up is motivated by peak-demand…
This paper considers weighted sum rate maximization constrained with a per base station (BS) antenna power problem for multiuser multiple-input multiple-output (MIMO) systems. For this problem, we propose new downlink-uplink duality based…
Consider a graph with nonnegative node weight. A vertex subset is called a CDS (connected dominating set) if every other node has at least one neighbor in the subset and the subset induces a connected subgraph. Furthermore, if every other…
The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from…
Constructing a connected dominating set as the virtual backbone plays an important role in wireless networks. In this paper, we propose two novel approximate algorithms for dominating set and connected dominating set in wireless networks,…