Mostra el registre d'ítem simple

dc.contributor.authorAusiello, Giorgio
dc.contributor.authorMarchetti-Spaccamela, Alberto
dc.contributor.authorProtasi, Marco
dc.date.accessioned2008-02-29T10:01:51Z
dc.date.available2008-02-29T10:01:51Z
dc.date.issued1981-03
dc.identifier.issn0210-8054 (versió paper)
dc.identifier.urihttp://hdl.handle.net/2099/4408
dc.description.abstractIn this paper results concerning structural and approximability properties of the subclass of NP-Complete Optimization Problems, defined over a lattice are considered. First, various approaches to the concept of Fully Polynomial Approximation Scheme are presented with application to several known problems in the class of NP-Complete Optimization Problems. Secondly, a characterization of full Approximability for the class of Max Subset Problems is introduced.
dc.format.extentp. 5-11
dc.language.isoeng
dc.publisherUniversitat Politècnica de Barcelona. Centre de Càlcul
dc.relation.ispartofQüestiió. 1981, vol.5, núm.1
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject.otherMathematical programming
dc.titleFull approximability of a class of problems over power sets
dc.typeArticle
dc.subject.lemacProgramació (Matemàtica)
dc.subject.amsClassificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
dc.rights.accessOpen Access
local.ordre3


Fitxers d'aquest items

Thumbnail

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

Mostra el registre d'ítem simple