Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth
From MaRDI portal
Publication:2938095
DOI10.1007/978-3-319-04298-5_7zbMath1432.68330OpenAlexW2202088500MaRDI QIDQ2938095
Erlebach, Thomas, Hasna Mohsen Alqahtani
Publication date: 13 January 2015
Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-04298-5_7
Related Items (2)
Hardness of minimum barrier shrinkage and minimum installation path ⋮ An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
This page was built for publication: Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth