Paper by Erik D. Demaine

Reference:

Erik D. Demaine and Quanquan C. Liu, “Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs”, in Proceedings of the 16th International Symposium on Algorithms and Data Structures (WADS 2017), July 31–August 2, 2017, pages 313–324.

BibTeX

@InProceedings{PebblesInapprox_WADS2017,
  AUTHOR        = {Erik D. Demaine and Quanquan C. Liu},
  TITLE         = {Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs},
  BOOKTITLE     = {Proceedings of the 16th International Symposium on Algorithms and Data Structures (WADS 2017)},
  bookurl       = {http://wads.org/},
  MONTH         = {July 31--August 2},
  YEAR          = 2017,
  PAGES         = {313--324},

  withstudent   = 1,
  papers        = {PebblesRedBlue_SPAA2018},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1007/978-3-319-62127-2_27">SpringerLink</A> and as <A HREF="https://arXiv.org/abs/1707.06343">arXiv:1707.06343</A>.},
}

Comments:

This paper is also available from SpringerLink and as arXiv:1707.06343.

Availability:

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

[Google Scholar search]

Related papers:

PebblesRedBlue_SPAA2018 (Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers)