相关论文: Minimum Shared-Power Edge Cut

We study the problem of optimal power allocation in a single-hop ad hoc wireless network. In solving this problem, we propose a hybrid neural architecture inspired by the algorithmic unfolding of the iterative weighted minimum mean squared…

For a positive integer $t$ and a graph $G$, an additive $t$-spanner of $G$ is a spanning subgraph in which the distance between every pair of vertices is at most the original distance plus $t$. Minimum Additive $t$-Spanner Problem is to…

Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set $P$ of points and a set $S$ of geometric objects, both in the plane, our goal is to find a subset $S'$ of $S$…

We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…

In the context of algorithm theory, various studies have been conducted on spanning trees with desirable properties. In this paper, we consider the \textsc{Minimum Cover Spanning Tree} problem (MCST for short). Given a graph $G$ and a…

Cell-free massive multiple-input multiple-output (CF mMIMO) has emerged as a prominent candidate for future networks due to its ability to significantly enhance spectral efficiency by eliminating inter-cell interference. However, its…

This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities…

The inference of minimum spanning arborescences within a set of objects is a general problem which translates into numerous application-specific unsupervised learning tasks. We introduce a unified and generic structure called edit…

A connected dominating set is a widely adopted model for the virtual backbone of a wireless sensor network. In this paper, we design an evolutionary algorithm for the minimum connected dominating set problem (MinCDS), whose performance is…

Minimum-weight cut (min-cut) is a basic measure of a network's connectivity strength. While the min-cut can be computed efficiently in the sequential setting [Karger STOC'96], there was no efficient way for a distributed network to compute…

During major power system disturbances, when multiple component outages occur in rapid succession, it becomes crucial to quickly identify the transmission interconnections that have limited power transfer capability. Understanding the…

A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \emph{receiver interference}. This is modeled as follows: each sensor node corresponds to a point in $\mathbb{R}^d$ and each…

The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives a proof that, for graphs where each…

We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity. Although it is NP-hard in general graphs, we demonstrate that a…

Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation $X$ on a directed graph $G$ into weighted source-to-sink paths whose superposition equals $X$. We show that, for…

This paper considers a multi-cell AirComp network and investigates the optimal power control policies over multiple cells to regulate the effect of inter-cell interference. First, we consider the scenario of centralized multi-cell power…

We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…

This paper presents parallel, distributed and quantum algorithms for single-source shortest paths when edges can have negative weights (negative-weight SSSP). We show a framework that reduces negative-weight SSSP in all these setting to…

We study the problem of optimal power allocation in a single-hop ad hoc wireless network. In solving this problem, we depart from classical purely model-based approaches and propose a hybrid method that retains key modeling elements in…

When multiple outages occur in rapid succession, it is important to know quickly if the power transfer capability of different interconnections (or cut-sets) of the power network are limited. The algorithm developed in this paper identifies…