Paper by Erik D. Demaine

Reference:

Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, and Oren Weimann, “The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs”, Journal of Combinatorial Optimization, volume 25, number 1, January 2013, pages 19–46.

BibTeX

@Article{StackMST_JOCO,
  AUTHOR        = {Jean Cardinal and Erik D. Demaine and Samuel Fiorini and
                   Gwena\"el Joret and Ilan Newman and Oren Weimann},
  TITLE         = {The {Stackelberg} Minimum Spanning Tree Game on Planar and
                   Bounded-Treewidth Graphs},
  JOURNAL       = {Journal of Combinatorial Optimization},
  journalurl    = {http://www.springerlink.com/content/102924/},
  MONTH         = {January},
  VOLUME        = 25,
  NUMBER        = 1,
  YEAR          = 2013,
  PAGES         = {19--46},

  replaces      = {StackMST_WINE2009},
  papers        = {StackMST_WINE2009; StackMST_Algorithmica},
  doi           = {https://dx.doi.org/10.1007/s10878-011-9414-2},
  dblp          = {https://dblp.org/rec/journals/jco/CardinalDFJNW13},
  comments      = {This paper is also available as
                   <A HREF="http://arXiv.org/abs/0909.3221">arXiv:0909.3221</A>
                   and from <A HREF="http://dx.doi.org/10.1007/s10878-011-9414-2">SpringerLink</A>.},
}

Comments:

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

Availability:

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

[Google Scholar search]

Related papers:

StackMST_WINE2009 (The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs)

StackMST_Algorithmica (The Stackelberg Minimum Spanning Tree Game)