Login / Signup

Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing.

Yair BartalAmos FiatStefano Leonardi
Published in: STOC (1996)
Keyphrases
  • lower bound
  • np complete
  • upper bound
  • randomly generated problems
  • learning algorithm
  • branch and bound
  • branch and bound algorithm
  • graph model
  • min sum