Approximating layout problems on random sparse graphs
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 f...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1998 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/84542 |
| Acceso en línea: | https://hdl.handle.net/2117/84542 |
| Access Level: | acceso abierto |
| Palabra clave: | Random sparse graphs Linear arrangement Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | 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. |
|---|