| dc.contributor.author | Díaz Cort, Josep |
| dc.contributor.author | Petit Silvestre, Jordi |
| dc.contributor.author | Serna Iglesias, María José |
| dc.contributor.author | Trevisan, Marco |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
| dc.date.accessioned | 2016-03-16T16:33:04Z |
| dc.date.available | 2016-03-16T16:33:04Z |
| dc.date.issued | 1998-07 |
| dc.identifier.citation | Diaz, J., Petit, J., Serna, M., Trevisan, M. "Approximating layout problems on random sparse graphs". 1998. |
| dc.identifier.uri | http://hdl.handle.net/2117/84542 |
| dc.description.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. |
| dc.format.extent | 10 p. |
| dc.language.iso | eng |
| dc.relation.ispartofseries | LSI-98-44-R |
| dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| dc.subject.other | Random sparse graphs |
| dc.subject.other | Linear arrangement |
| dc.title | Approximating layout problems on random sparse graphs |
| dc.type | External research report |
| dc.rights.access | Open Access |
| local.identifier.drac | 515063 |
| dc.description.version | Postprint (published version) |
| local.citation.author | Diaz, J.; Petit, J.; Serna, M.; Trevisan, M. |
