Paper by Erik D. Demaine

Reference:

Hugo A. Akitaya, Ahmad Biniaz, Erik D. Demaine, Linda Kleist, Frederick Stock, and Csaba D. Tóth, “Minimum Plane Bichromatic Spanning Trees”, ACM Transactions on Algorithms, volume 21, number 4, 2025, 48:1–48:14.

BibTeX

@Article{BichromaticMST_TALG,
  AUTHOR        = {Hugo A. Akitaya and Ahmad Biniaz and Erik D. Demaine and Linda Kleist and Frederick Stock and Csaba D. T{\'o}th},
  TITLE         = {Minimum Plane Bichromatic Spanning Trees},
  JOURNAL       = {ACM Transactions on Algorithms},
  journalurl    = {http://www.acm.org/talg/},
  VOLUME        = 21,
  NUMBER        = 4,
  YEAR          = 2025,
  PAGES         = {48:1--48:14},

  withstudent   = 1,
  replaces      = {BichromaticMST_ISAAC2024},
  papers        = {BichromaticMST_ISAAC2024},
  doi           = {https://dx.doi.org/10.1145/3747591},
  dblp          = {https://dblp.org/rec/journals/talg/AkitayaBDKST25},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1145/3747591">ACM</A>.},
}

Comments:

This paper is also available from ACM.

Availability:

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

[Google Scholar search]

Related papers:

BichromaticMST_ISAAC2024 (Minimum Plane Bichromatic Spanning Trees)