Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

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.

The following publications are possibly variants of this publication:

Constructing minimum changeover cost arborescenses in bounded treewidth graphsDidem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks. TCS, 621:22-36, 2016. [doi]

On the complexity of constructing minimum changeover cost arborescencesDidem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks. TCS, 540:40-52, 2014. [doi]

runs on WebDSL