Mostra el registre d'ítem simple

Some remarks on the approximability of graph layout problems

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.date.accessioned2016-11-25T11:48:59Z
dc.date.available2016-11-25T11:48:59Z
dc.date.issued1994-03
dc.identifier.citationDiaz, J., Serna, M., Spirakis, P.G. "Some remarks on the approximability of graph layout problems". 1994.
dc.identifier.urihttp://hdl.handle.net/2117/97242
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.language.isoeng
dc.relation.ispartofseriesLSI-94-16-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Programació
dc.subject.otherGraph layout
dc.subject.otherMINCUT
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
local.identifier.drac514952
dc.description.versionPostprint (published version)
local.citation.authorDiaz, J.; Serna, M.; Spirakis, P.G.


Fitxers d'aquest items

Thumbnail
Nom:
1400190381.pdf
Mida:
448,8Kb
Format:
PDF
Visualitza/Obre

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple