Graph layout problems are a particular class of combinatorial optimization problems whose
goal is to find a linear layout of an input graph in such way that a certain objective cost is …

Although this may seem a paradox, all exact science is dominated by the idea of
approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including …

Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …

A combination of distributed computation, positive feedback and constructive greedy
heuristic is proposed as a new approach to stochastic optimization and problem solving …

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 …

In this paper, we show that any n point metric space can be embedded into a distribution
over dominating tree metrics such that the expected stretch of any edge is O (log n). This …

In this paper we consider the problem of (k, υ)-balanced graph partitioning-dividing the
vertices of a graph into k almost equal size components (each of size less than υ• nk) so that …

This paper provides a novel technique for the analysis of randomized algorithms for
optimization problems on metric spaces, by relating the randomized performance ratio for …

There are many applications in which it is desirable to order rather than classify instances.
Here we consider the problem of learning how to order, given feedback in the form of …

Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …