Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, and Andrew van der Poel, “Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class”, in Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019), edited by Michael A. Bender, Ola Svensson, and Grzegorz Herman, LIPIcs, volume 144, Munich, Germany, September 9–13, 2019, 37:1–37:15.

BibTeX

@InProceedings{StructuralRounding_ESA2019,
  AUTHOR        = {Erik D. Demaine and Timothy D. Goodrich and Kyle Kloster and Brian Lavallee and Quanquan C. Liu and Blair D. Sullivan and Ali Vakilian and Andrew van der Poel},
  TITLE         = {Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class},
  BOOKTITLE     = {Proceedings of the 27th Annual European Symposium on Algorithms (ESA 2019)},
  bookurl       = {https://algo2019.ak.in.tum.de/},
  SERIES        = {LIPIcs},
  VOLUME        = 144,
  EDITOR        = {Michael A. Bender and Ola Svensson and Grzegorz Herman},
  ADDRESS       = {Munich, Germany},
  MONTH         = {September 9--13},
  YEAR          = 2019,
  PAGES         = {37:1--37:15},

  withstudent   = 1,
  doi           = {https://dx.doi.org/10.4230/LIPIcs.ESA.2019.37},
  dblp          = {https://dblp.org/rec/conf/esa/DemaineGKLLSVP19},
  comments      = {This paper is also available as <A HREF="https://arxiv.org/abs/1806.02771">arXiv:1806.02771</A> and from <A HREF="https://dx.doi.org/10.4230/LIPIcs.ESA.2019.37">LIPIcs</A>.},
}

Comments:

This paper is also available as arXiv:1806.02771 and from LIPIcs.

Availability:

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

[Google Scholar search]