Mostra el registre d'ítem simple

Parallel approximability of MAX NP problems

dc.contributor.authorSerna Iglesias, María José
dc.contributor.authorXhafa Xhafa, Fatos
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-02-03T10:53:41Z
dc.date.available2016-02-03T10:53:41Z
dc.date.issued1995-01-01
dc.identifier.citationSerna Iglesias, María José; Xhafa Xhafa, Fatos. "Parallel approximability of MAX NP problems". 1995.
dc.identifier.urihttp://hdl.handle.net/2117/82476
dc.description.abstractWe study the relationship between the computationally defined class NCX of all optimization problems that are approximable within constant ratio in NC and syntactically defined classes MAXSNP and MAXNP. A simple observation shows that any problem in MAXSNP is constant approximable in NC. We show that MAXNP is also contained in NCX.
dc.format.extent7 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-95-40-R
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherMAXNP
dc.subject.otherMAXSNP
dc.titleParallel approximability of MAX NP problems
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac647348
dc.description.versionPostprint (published version)


Fitxers d'aquest items

Thumbnail
Nom:
R95-40.ps
Mida:
77,29Kb
Format:
Postscript
Visualitza/Obre

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

Mostra el registre d'ítem simple