Some remarks on the approximability of graph layout problems
In this paper we look at several well known layout problems. We show that MINCUT layout and Topological bandwidth cannot be approximated unless P=NP, whereas the Maximum linear arrangement problem can be approximated within a constant factor. We also consider some restriction of the MINSUMCUT proble...
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1994 |
| 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/97242 |
| Acceso en línea: | https://hdl.handle.net/2117/97242 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph layout MINCUT Topological bandwith MINSUMCUT problem Àrees temàtiques de la UPC::Informàtica::Programació |
| Sumario: | In this paper we look at several well known layout problems. We show that MINCUT layout and Topological bandwidth cannot be approximated unless P=NP, whereas the Maximum linear arrangement problem can be approximated within a constant factor. We also consider some restriction of the MINSUMCUT problem, showing that the problem is in P for, weighted trees, grids without holes and outerplanar graphs. Finally we give a strong indication that graph bisection is as hard to approximate as MINLA. |
|---|