Full approximability of a class of problems over power sets

• Autores: Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
• Localización: Questiió: Quaderns d'Estadística, Sistemes, Informatica i Investigació Operativa, ISSN 0210-8054, Vol. 5, Nº. 1, 1981, págs. 5-11
• Idioma: inglés
• Títulos paralelos:
  • Aproximabilidad completa de una clase de problemas sobre conjuntos potencias
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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