Paper by Erik D. Demaine

Reference:

Erik D. Demaine and Victor Luo, “Euclidea is APX-hard: Complexity of Optimizing Euclidean Constructions”, Journal of Information Processing, volume 33, 2025, pages 1110–1117.

BibTeX

@Article{Euclidea_JIP,
  AUTHOR        = {Erik D. Demaine and Victor Luo},
  TITLE         = {Euclidea is {APX}-hard: Complexity of Optimizing {Euclidean} Constructions},
  JOURNAL       = {Journal of Information Processing},
  journalurl    = {http://www.ipsj.or.jp/english/jip/},
  VOLUME        = 33,
  YEAR          = 2025,
  PAGES         = {1110--1117},

  withstudent   = 1,
  doi           = {https://dx.doi.org/10.2197/ipsjjip.33.1110},
  dblp          = {https://dblp.org/rec/journals/jip/DemaineL25},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.2197/IPSJJIP.33.1110">J-STAGE</A>.},
}

Comments:

This paper is also available from J-STAGE.

Availability:

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

[Google Scholar search]