Mostra el registre d'ítem simple
Full approximability of a class of problems over power sets
dc.contributor.author | Ausiello, Giorgio |
dc.contributor.author | Marchetti-Spaccamela, Alberto |
dc.contributor.author | Protasi, Marco |
dc.date.accessioned | 2008-02-29T10:01:51Z |
dc.date.available | 2008-02-29T10:01:51Z |
dc.date.issued | 1981-03 |
dc.identifier.issn | 0210-8054 (versió paper) |
dc.identifier.uri | http://hdl.handle.net/2099/4408 |
dc.description.abstract | In 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.extent | p. 5-11 |
dc.language.iso | eng |
dc.publisher | Universitat Politècnica de Barcelona. Centre de Càlcul |
dc.relation.ispartof | Qüestiió. 1981, vol.5, núm.1 |
dc.rights | Attribution-NonCommercial-NoDerivs 2.5 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.5/es/ |
dc.subject.other | Mathematical programming |
dc.title | Full approximability of a class of problems over power sets |
dc.type | Article |
dc.subject.lemac | Programació (Matemàtica) |
dc.subject.ams | Classificació AMS::90 Operations research, mathematical programming::90C Mathematical programming |
dc.rights.access | Open Access |
local.ordre | 3 |