Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs

Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks. Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. In Ekrem Duman, Ali Fuat Alkaya, editors, 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, May 26-28, 2015. pages 201-204, 2015.

@inproceedings{GozupekSSZ15,
  title = {Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs},
  author = {Didem Gözüpek and Hadas Shachnai and Mordechai Shalom and Shmuel Zaks},
  year = {2015},
  researchr = {https://researchr.org/publication/GozupekSSZ15},
  cites = {0},
  citedby = {0},
  pages = {201-204},
  booktitle = {13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, May 26-28, 2015},
  editor = {Ekrem Duman and Ali Fuat Alkaya},
}