The Approximability Behaviour of Some Combinatorial Problems with Respectto the Approximability of a Class of Maximum Independent Set Problems

  • Authors:

  • Marc Demange;Vangelis Th. Paschos

  • Affiliations:

  • LAMSADE, Université/ Paris-Dauphine, Place du Maré/chal De Lattre de Tassigny, 75775 Paris Cedex 16, France/ E-mail: demange@univ_paris1.fr, paschos@lamsade.dauphine.fr;LAMSADE, Université/ Paris-Dauphine, Place du Maré/chal De Lattre de Tassigny, 75775 Paris Cedex 16, France/ E-mail: demange@univ_paris1.fr, paschos@lamsade.dauphine.fr

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove that the existence of a polynomial timeρ-approximation algorithm (whereρ