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

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

This paper studies the fundamental task of establishing routing paths in distributed networks.
We prove the existence of compact routing tables that store in each network-node few …

O (c+ d) steps using constant-size queues, where c is the congestion of the paths in the
network, and d is the length of the longest path. The proof, however, used the Lovász Local …

We develop constant-factor approximation algorithms for minimizing the execution time of a
coordinated parallel motion plan for a relatively dense swarm of homogeneous robots in the …

In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected
network G=(V, E) with edge capacities and a set of terminal pairs (or requests) with …

Motivated by the increasing need to understand the distributed algorithmic foundations of
large-scale graph computations, we study some fundamental graph problems in a message …

Packet-scheduling is a particular challenge in wireless networks due to interference from
nearby transmissions. A distance-2 interference model serves as a useful abstraction here …

We prove the existence of an oblivious routing scheme that is poly (log n)-competitive in
terms of (congestion+ dilation), thus resolving a well-known question in oblivious routing …

This paper studies the question of how to run many distributed algorithms, solving
independent problems, together as fast as possible. Suppose that we want to run distributed …