• Approximating layout problems on random sparse graphs 

      Díaz Cort, Josep; Petit Silvestre, Jordi; Serna Iglesias, María José; Trevisan, Marco (1998-07)
      Report de recerca
      Accés obert
      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, ...