Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth

Hasna Mohsen Alqahtani, Thomas Erlebach. Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth. In Viliam Geffert, Bart Preneel, Branislav Rovan, Julius Stuller, A Min Tjoa, editors, SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, NovĂ˝ Smokovec, Slovakia, January 26-29, 2014, Proceedings. Volume 8327 of Lecture Notes in Computer Science, pages 65-76, Springer, 2014. [doi]

Abstract

Abstract is missing.