Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …

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

In the near future, a pervasive computing environment can be expected based on the recent
progress and advances in computing and communication technologies. The next generation …

Telecommunication networks are currently realizing more-huge-than-ever data demands
from subscribers all over the world. Due to the ongoing pandemic, nearly all businesses …

Many combinatorial problems are NP-complete for general graphs. However, when
restricted to series–parallel graphs or partial k-trees, many of these problems can be solved …

Given a graph and terminal pairs (s_i,t_i), i∈k, the edge-disjoint paths problem is to
determine whether there exist s_it_i paths, i∈k, that do not share any edges. We consider …

This paper introduces a network coding-based protection scheme against single-and
multiple-link failures. The proposed strategy ensures that in a connection, each node …

Background Genome assembly is difficult due to repeated sequences within the genome,
which create ambiguities and cause the final assembly to be broken up into many separate …

Motivated by conversations with operators and by possibilities to unlock future Internet-
based applications, we study how to enable Internet Service Providers (ISPs) to reliably offer …

Abstract The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s
1, t 1),…,(sk, tk), whether there is a collection of k pairwise vertex-disjoint paths linking si and …