Related papers: Geometry and Analytics of the Multifacility Weber …
This paper addresses the optimal design of wireless networks through the site and power assignment problem. Given a set of candidate transmitters, this problem involves choosing optimal transmitter locations and powers to provide service…
We study co-primary spectrum sharing concept in two small cell multiuser network. Downlink transmission is explored with Rayleigh fading in interfering broadcast channel. Both base stations and all the users are equipped with multiple…
With the growing attention towards developing the multimodal transport system to enhance urban mobility, there is an increasing need to construct new, rebuild or expand existing infrastructure to facilitate existing and accommodate newly…
Many complex systems demand manifold resources to be supplied from distinct channels to function properly, i.e, water, gas, and electricity for a city. Here, we study a model for viability of such systems demanding more than one type of…
Weight thresholding is a simple technique that aims at reducing the number of edges in weighted networks that are otherwise too dense for the application of standard graph theoretical methods. We show that the group structure of real…
In the $k$-Center problem, we are given a graph $G=(V,E)$ with positive edge weights and an integer $k$ and the goal is to select $k$ center vertices $C \subseteq V$ such that the maximum distance from any vertex to the closest center…
Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful…
We consider practical methods for the problem of finding a minimum-weight triangulation (MWT) of a planar point set, a classic problem of computational geometry with many applications. While Mulzer and Rote proved in 2006 that computing an…
We consider a network design problem called the generalized terminal backup problem. Whereas earlier work investigated the edge-connectivity constraints only, we consider both edge- and node-connectivity constraints for this problem. A…
Given a graph $G$, a set $T$ of terminal vertices, and a demand graph $H$ on $T$, the \textsc{Multicut} problem asks for a set of edges of minimum weight that separates the pairs of terminals specified by the edges of $H$. The…
In order to cope with the rapidly increasing service demand in cellular networks, more cells are needed with better resource usage efficiency. This poses challenges for the network planning since service demand in practical networks is not…
In the Steiner Tree problem we are given an undirected edge-weighted graph as input, along with a set $K$ of vertices called terminals. The task is to output a minimum-weight connected subgraph that spans all the terminals. The famous…
In this paper we propose an extension of the Uncapacitated Hub Location Problem where the potential positions of the hubs are not fixed in advance. Instead, they are allowed to belong to a region around an initial discrete set of nodes. We…
Multi-way tables with specified marginals arise in a variety of applications in statistics and operations research. We provide a comprehensive complexity classification of three fundamental computational problems on tables: existence,…
We present a unified analytical framework within which power control, rate allocation, routing, and congestion control for wireless networks can be optimized in a coherent and integrated manner. We consider a multi-commodity flow model with…
In this paper, a new multi-hop weighted clustering procedure is proposed for homogeneous Mobile Ad hoc networks. The algorithm generates double star embedded non-overlapping cluster structures, where each cluster is managed by a leader node…
Correlators of Wilson-line operators in non-abelian gauge theories are known to exponentiate, and their logarithms can be organised in terms of collections of Feynman diagrams called webs. In [1] we introduced the concept of Cweb, or…
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.
The exploitation of already deployed wireless local area networks (WLAN)s (e.g., WiFi access points (AP)s) has attracted considerable attention, as an efficient and practical method to improve the performance of beyond 4G wireless networks.…
The surest way to increase the system capacity of a wireless link is by getting the transmitter and receiver closer to each other, which creates the dual benefits of higher quality links and more spatial reuse. In a network with nomadic…