Approximating layout problems on geometric random graphs

Abstract

We show two simple algorithms that, with high probability, approximate within a constant several layout problems for geometric random graphs drawn from the Gn(r) model r_cv(log¿¿n/n¿ ) for any constant c = 6. The layout problems that we consider are: Bandwidth, Minimum Linear Arrangement, Minimum Cut, Minimum Sum Cut, Vertex Separation and Bisection.