We give approximation algorithms for the Survivable Network problem. The input consists of
a graph G=(V, E) with edge/node-costs, a node subset S⊆ V, and connectivity requirements …

This paper studies distributed resource allocation and sum-preserving constrained
optimization over lossy networks, with unreliable links and subject to packet drops. We find …

Background: COVID 19 created a challenging situation for many of the industries across the
globe. Our primary focus is on the most affected airline industry. In this paper, the …

We consider node-weighted survivable network design (SNDP) in planar graphs and minor-
closed families of graphs. The input consists of a node-weighted undirected graph G=(V, E) …

In minimum power network design problems we are given an undirected graph G=(V, E) with
edge costs {ce: e∈ E}. The goal is to find an edge set F⊆ E that satisfies a prescribed …

Background: Graph analytics is one of the foremost established and unique strategies
utilized in taking care of present-day designing issues. In this study, this procedure was …

Cyber physical system (CPS) is consisting of two interdependent networks, ie, a cyber
network embedding into a physical network. Although interdependence makes the system …

Abstract In the Survivable Networks Activation problem we are given a graph G=(V, E), S⊆
V, a family {fuv (xu, xv): uv∈ E} of monotone non-decreasing activating functions from R+ 2 …

In Network Design problems, the goal is to select a “cheap” graph that satisfies some
property 𝒢, meaning that the graph belongs to a family 𝒢 of subgraphs of a given graph G …

This paper considers distributed resource allocation and sum-preserving constrained
optimization over lossy networks, where the links are unreliable and subject to packet drops …