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
CitationDiaz, J., Petit, J., Serna, M., Trevisan, M. "Approximating layout problems on random sparse graphs". 1998.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com