Flood search under the California Split rule

Y. Baryshnikov, E. Coffman, P. Jelenković, P. Momčilović, D. Rubenstein

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

The flood searching algorithm, under the California Split rule, was studied. The flood search on a line indicated that no algorithm was capable of achieving an average-case competitive ratio of less than 4 in comparison to an optimal off-line algorithm. The study described the employed optimal scanning sequences. The sequences were obtained via recursive algorithms, which yield to complex behavior related to Hamiltonian chaos.

Original languageEnglish
Pages (from-to)199-206
Number of pages8
JournalOperations Research Letters
Volume32
Issue number3
DOIs
Publication statusPublished - May 1 2004
Externally publishedYes

Fingerprint

Line
Competitive Ratio
Recursive Algorithm
Hamiltonians
Scanning
Chaos
Chaos theory
Competitive ratio
Recursive algorithm

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this

Baryshnikov, Y., Coffman, E., Jelenković, P., Momčilović, P., & Rubenstein, D. (2004). Flood search under the California Split rule. Operations Research Letters, 32(3), 199-206. https://doi.org/10.1016/j.orl.2003.08.007

Flood search under the California Split rule. / Baryshnikov, Y.; Coffman, E.; Jelenković, P.; Momčilović, P.; Rubenstein, D.

In: Operations Research Letters, Vol. 32, No. 3, 01.05.2004, p. 199-206.

Research output: Contribution to journalArticle

Baryshnikov, Y, Coffman, E, Jelenković, P, Momčilović, P & Rubenstein, D 2004, 'Flood search under the California Split rule', Operations Research Letters, vol. 32, no. 3, pp. 199-206. https://doi.org/10.1016/j.orl.2003.08.007
Baryshnikov Y, Coffman E, Jelenković P, Momčilović P, Rubenstein D. Flood search under the California Split rule. Operations Research Letters. 2004 May 1;32(3):199-206. https://doi.org/10.1016/j.orl.2003.08.007
Baryshnikov, Y. ; Coffman, E. ; Jelenković, P. ; Momčilović, P. ; Rubenstein, D. / Flood search under the California Split rule. In: Operations Research Letters. 2004 ; Vol. 32, No. 3. pp. 199-206.
@article{ee7e5952eac94894828a84cfde0303aa,
title = "Flood search under the California Split rule",
abstract = "The flood searching algorithm, under the California Split rule, was studied. The flood search on a line indicated that no algorithm was capable of achieving an average-case competitive ratio of less than 4 in comparison to an optimal off-line algorithm. The study described the employed optimal scanning sequences. The sequences were obtained via recursive algorithms, which yield to complex behavior related to Hamiltonian chaos.",
author = "Y. Baryshnikov and E. Coffman and P. Jelenković and P. Momčilović and D. Rubenstein",
year = "2004",
month = "5",
day = "1",
doi = "10.1016/j.orl.2003.08.007",
language = "English",
volume = "32",
pages = "199--206",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Flood search under the California Split rule

AU - Baryshnikov, Y.

AU - Coffman, E.

AU - Jelenković, P.

AU - Momčilović, P.

AU - Rubenstein, D.

PY - 2004/5/1

Y1 - 2004/5/1

N2 - The flood searching algorithm, under the California Split rule, was studied. The flood search on a line indicated that no algorithm was capable of achieving an average-case competitive ratio of less than 4 in comparison to an optimal off-line algorithm. The study described the employed optimal scanning sequences. The sequences were obtained via recursive algorithms, which yield to complex behavior related to Hamiltonian chaos.

AB - The flood searching algorithm, under the California Split rule, was studied. The flood search on a line indicated that no algorithm was capable of achieving an average-case competitive ratio of less than 4 in comparison to an optimal off-line algorithm. The study described the employed optimal scanning sequences. The sequences were obtained via recursive algorithms, which yield to complex behavior related to Hamiltonian chaos.

UR - http://www.scopus.com/inward/record.url?scp=0346280063&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346280063&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2003.08.007

DO - 10.1016/j.orl.2003.08.007

M3 - Article

AN - SCOPUS:0346280063

VL - 32

SP - 199

EP - 206

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 3

ER -