Minimum activation cost node-disjoint paths in graphs with bounded treewidth

DOI10.1007/978-3-319-04298-5_7MaRDI QIDQ2938095zbMATH OpenOpenAlexFDO

Authors Hasna Mohsen Alqahtani, Thomas Erlebach

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimum activation cost edge-disjoint paths in graphs with bounded tree-width
• Approximation algorithms for disjoint \(st\)-paths with minimum activation cost
• Survivable network activation problems
• Survivable network activation problems
• On routing disjoint paths in bounded treewidth graphs

Cited in

(5)

• An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
• Minimum activation cost edge-disjoint paths in graphs with bounded tree-width
• Approximation algorithms for disjoint \(st\)-paths with minimum activation cost
• Hardness of minimum barrier shrinkage and minimum installation path
• A \(2\sqrt{2k}\)-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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938095)