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, Leibniz International Proceedings in Informatics, volume 144, Munich, Germany, September 9–13, 2019, 37:1–37:15.

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]


See also other papers by Erik Demaine.
These pages are generated automagically from a BibTeX file.
Last updated February 10, 2020 by Erik Demaine.