Many network problems are based on fundamental relationships involving time. Consider,
for example, the problems of modeling the flow of information through a distributed network …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Mobile Edge Computing (MEC) offers a way to shorten the cloud servicing delay by building
the small-scale cloud infrastructures at the network edge, which are in close proximity to the …

Network survivability—the ability to maintain operation when one or a few network
components fail—is indispensable for present‐day networks. In this paper, we characterize …

The construction of disjoint paths in a network is a basic issue in combinatorial optimization:
given a network, and specified pairs of nodes in it, we are interested in finding disjoint paths …

Due to the fact that no NP-complete problem can be solved in polynomial time (unless P=
NP), many approximability results (both positive and negative) of NP-hard optimization …

In some special circumstances (eg, tsunamis, battlefields, and earthquakes), communication
infrastructures are damaged or nonexistent. For communication among people, mobile …

Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and
WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and …

The problem of finding link/node‐disjoint paths between a pair of nodes in a network has
received much attention in the past. This problem is fairly well understood when the links in …

The disjoint shortest paths problem is defined as follows. Given a graph G and k pairs of
distinct vertices (si, ti), 1⩽ i⩽ k, find whether there exist k pairwise disjoint shortest paths Pi …