Login / Signup

Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP.

Edith HemaspaandraJörg RotheHolger Spakowski
Published in: WG (2002)
Keyphrases
  • parallel processing
  • search algorithm
  • np hard
  • np complete
  • access control
  • massively parallel
  • computational complexity
  • directed graph
  • parallel implementation
  • database
  • branch and bound
  • shared memory
  • minimum length