Login / Signup

Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems.

Viggo Kann
Published in: MFCS (1995)
Keyphrases
  • lower bound
  • upper bound
  • objective function
  • np complete
  • data sets
  • np hard
  • reinforcement learning
  • branch and bound algorithm
  • solving problems
  • min sum