Show simple item record

dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorSerna Iglesias, María José
dc.contributor.authorSpirakis, Paul George
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationDiaz, J., Serna, M., Spirakis, P.G. "Some remarks on the approximability of graph layout problems". 1994.
dc.description.abstractIn 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.
dc.format.extent8 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Programació
dc.subject.otherGraph layout
dc.subject.otherTopological bandwith
dc.subject.otherMINSUMCUT problem
dc.titleSome remarks on the approximability of graph layout problems
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorDiaz, J.; Serna, M.; Spirakis, P.G.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder