From social networks such as Facebook, the World Wide Web and the Internet, to the
complex interactions between proteins in the cells of our bodies, we constantly face the …

Although the theory of random graphs is one of the youngest branches of graph theory, in
importance it is second to none. It began with some sporadic papers of Erdős in the 1940s …

When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions …

The random assignment (or bipartite matching) problem asks about An= minπ∑ c (i, π (i)),
where (c (i, j)) is an× n matrix with iid entries, say with exponential (1) distribution, and the …

We show that a certain 3-dimensional assignment problem is NP-complete. To do this we
show that the following problem is NP-complete: given bipartite graphs G 1, G 2 with the …

An assignment problem is the optimization problem of finding, in an m by n matrix of
nonnegative real numbers, k entries, no two in the same row or column, such that their sum …

Computational complexity for physicists Page 1 MAY/JUNE 2002 31 L IMITS OF C
OMPUTATION Compared to the traditionally close rela- tionship between physics and mathe …

Suppose that there are n jobs and n machines and it costs cij to execute job i on machine j.
The assignment problem concerns the determination of a one‐to‐one assignment of jobs …

We address the problem of evaluating the expected optimal objective value of a 0-1
optimization problem under uncertainty in the objective coefficients. The probabilistic model …

Analysis of random instances of optimization problems provides valuable insights into the
behavior and properties of problem's solutions, feasible region, and optimal values …