Abstract:
|
We show that, with high probability, several layout problems are
approximable within a constant for random graphs drawn from the
standard Gnp model with p=c/n for some constant c. Our results
establish that, in fact, any algorithm that returns a feasible
solution will produce such an approximation for graphs with good
expansion properties. |