Various aspects of the theory of random walks on graphs are surveyed. In particular,
estimates on the important parameters of access time, commute time, cover time and mixing …

Cuts and metrics are well-known objects that arise-independently, but with many deep and
fascinating connections-in diverse fields: in graph theory, combinatorial optimization …

In this paper we explore some implications of viewing graphs as geometric objects. This
approach offers a new perspective on a number of graph-theoretic and algorithmic …

In this paper, we establish max-flow min-cut theorems for several important classes of
multicommodity flow problems. In particular, we show that for any n-node multicommodity …

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

The general problem of computing posterior probabilities in Bayesian networds is NP-hard
(Cooper 1990). However efficient algorithms are often possible for particular applications by …

We give the first approximation algorithm for the generalized network Steiner problem, a
problem in network design. An instance consists of a network with link-costs and} for each …

This thesis deals with the polynomial approximability of combinatorial optimization problems
which are NP-complete in their decision problem version. Different measures of …

We study the maximum integral multicommodity flow problem and the minimum multicut
problem restricted to trees. This restriction is quite rich and contains as special cases …

This book presents a nearly complete classification of various restricted classes of
computational problems called Boolean constraint satisfaction problems. Roughly, these are …