Login / Signup

Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover.

Takuya AkibaYoichi Iwata
Published in: ALENEX (2015)
Keyphrases
  • vertex cover
  • worst case
  • approximation algorithms
  • optimality criterion
  • computational complexity
  • special case
  • np complete
  • planar graphs