Note: On the complexity of approximating the Hadwiger number

  • Authors:

  • Martin Wahlén

  • Affiliations:

  • Department of Computer Science, Lund University, Box 118, S-22100 Lund, Sweden

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 5.23

Visualization

Abstract

Unless P = NP there is no polynomial time approximation scheme (PTAS) for the problem of finding, for a graph G, the largest h such that the complete graph K"h is a minor of G.