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

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.

This author has not been identified. Look up 'Didem Gözüpek' in GoogleThis author has not been identified. Look up 'Hadas Shachnai' in GoogleThis author has not been identified. Look up 'Mordechai Shalom' in GoogleThis author has not been identified. Look up 'Shmuel Zaks' in Google

runs on WebDSL