In interval scheduling, not only the processing times of the jobs but also their starting times
are given. This article surveys the area of interval scheduling and presents proofs of results …

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

This chapter focuses on approximation algorithms, which are algorithms of the second kind
with a provably good worst‐case ratio between the value of the solution found by the …

We consider the all-or-nothing multicommodity flow problem in general graphs. We are
given a capacitated undirected graph G=(V, E, u) and set of k pairs s 1 t 1, s 2 t 2,…, sktk …

We present Sentinel, a novel failure recovery system for traffic engineering that pre-
computes and installs backup tunnels to improve the robustness of software defined wide …

A distributed consensus algorithm allows n processes to reach a common decision value
starting from individual inputs. Wait-free consensus, in which a process always terminates …

In this paper we study the SRDM problem motivated by a variety of practical applications.
We are given n jobs with integer release times, deadlines, and processing times. The goal is …

The problem of scheduling jobs with interval constraints is a well-studied classical
scheduling problem. The input to the problem is a collection of n jobs where each job has a …

Motivated by issues of saving energy in data centers we define a collection of new problems
referred to as “machine activation” problems. The central framework we introduce considers …

The heterogeneous ultra-dense network (UDN) has been widely regarded as a promising
architecture for co** with the massive data traffic in future mobile networks including fifth …