Flood search under the California Split rule

  • Authors:
  • Y. Baryshnikov;E. Coffman;P. Jelenković;P. MomčIlović;D. Rubenstein

  • Affiliations:
  • Bell Labs, Lucent Technologies, Murray Hill, NJ 07974, USA;Department of Electrical Engineering, Columbia University, NY 10027, USA;Department of Electrical Engineering, Columbia University, NY 10027, USA;Department of Electrical Engineering, Columbia University, NY 10027, USA;Department of Electrical Engineering, Columbia University, NY 10027, USA

  • Venue:
  • Operations Research Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider flood search on a line and show that no algorithm can achieve an average-case competitive ratio of less than 4 when compared to the optimal off-line algorithm. We also demonstrate that the optimal scanning sequences are described by simple recursive relationships that yield surprisingly complex behavior related to Hamiltonian chaos.