论文信息 - Flood search under the California Split rule

Flood search under the California Split rule

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.

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

[1] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..

[2] P. Hudson. Search Games , 1982 .

[3] Patrick Jaillet,et al. Note: Online Searching / on the Optimality of the Geometric Sequences for the m Ray Search Online Searching , 2002, Oper. Res..

[4] Richard M. Karp,et al. Optimization problems in congestion control , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.

[6] Ian Clarke,et al. Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[7] Patrick Jaillet,et al. Online Searching , 2001, Oper. Res..

[8] Edith Cohen,et al. Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[9] Lada A. Adamic,et al. Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[11] Edith Cohen,et al. Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

[12] Ming-Yang Kao,et al. Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[13] M. Tabor. Chaos and Integrability in Nonlinear Dynamics: An Introduction , 1989 .