Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Sándor P. Fekete, and Shmuel Gal, “Online Searching with Turn Cost”, Theoretical Computer Science, volume 361, number 2–3, September 2006, pages 342–355. Special issue on approximation and online algorithms.

BibTeX

@Article{SearchTurnCost_TCS,
  AUTHOR        = {Erik D. Demaine and S{\'a}ndor P. Fekete and Shmuel Gal},
  TITLE         = {Online Searching with Turn Cost},
  JOURNAL       = {Theoretical Computer Science},
  journalurl    = {https://www.journals.elsevier.com/theoretical-computer-science},
  VOLUME        = 361,
  NUMBER        = {2--3},
  MONTH         = {September},
  YEAR          = 2006,
  PAGES         = {342--355},
  NOTE          = {Special issue on approximation and online algorithms.},

  doi           = {https://dx.doi.org/10.1016/J.TCS.2006.05.018},
  dblp          = {https://dblp.org/rec/journals/tcs/DemaineFG06},
  COMMENTS      = {This paper is also available as
                   <A HREF="http://arxiv.org/abs/cs.DS/0406045">
                   arXiv:cs.DS/0406045</A> of the
                   <A HREF="http://arXiv.org/archive/cs/intro.html">
                   Computing Research Repository (CoRR)</A>,
                   and from
                   <A HREF="http://dx.doi.org/10.1016/j.tcs.2006.05.018">ScienceDirect</A>.},
}

Comments:

This paper is also available as arXiv:cs.DS/0406045 of the Computing Research Repository (CoRR), and from ScienceDirect.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]