Approximating layout problems on geometric random graphs
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 Cu...
| 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/371020 |
| Acceso en línea: | https://hdl.handle.net/2117/371020 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph algorithms Algorismes de grafs Àrees temàtiques de la UPC::Informàtica |
| Sumario: | 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. |
|---|