Based on a lecture course given at Chalmers University of Technology, this 2002 book is
ideal for advanced undergraduate or beginning graduate students. The author first develops …

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

" A very simple but instructive problem was treated by Jacob Steiner, the famous
representative of geometry at the University of Berlin in the early nineteenth century. Three …

Providing a graduate-level introduction to discrete probability and its applications, this book
develops a toolkit of essential techniques for analysing stochastic processes on graphs …

In recent years, the scalability issue of blockchain protocols has received huge attention.
Sharding is one of the most promising solutions to scale blockchain. The basic idea behind …

Many graphs arising in various information networks exhibit the" power law" behavior–the
number of vertices of degree k is proportional to k-β for some positive β. We show that if β> …

We present a new structural (or syntatic) approach for estimating the satisfiability threshold
of random 3-SAT formulae. We show its efficiency in obtaining a jump from the previous …

In this work we analyze the problem of phase retrieval from Fourier measurements with
random diffraction patterns. To this end, we consider the recently introduced PhaseLift …

The problem of retrieving phase information from amplitude measurements alone has
appeared in many scientific disciplines over the last century. PhaseLift is a recently …

We study the problem of routing traffic through a congested network. We focus on the
simplest case of a network consisting of m parallel links. We assume a collection of n …