Survivable network activation problems

DOI10.1007/978-3-642-29344-3_50MaRDI QIDQ2894501zbMATH OpenOpenAlexFDO

Authors Zeev Nutov

Publication date 29 June 2012

Published in LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29344-3_50

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Survivable network activation problems
• Survivable network design problems in wireless networks
• Approximation algorithms for disjoint \(st\)-paths with minimum activation cost
• Spider covers for prize-collecting network activation problem
• Spider covers for prize-collecting network activation problem

Cited in

(7)

• 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
• Survivable network design problems in wireless networks
• Minimum activation cost node-disjoint paths in graphs with bounded treewidth
• Spider covers for prize-collecting network activation problem
• Survivable network activation problems

This page was built for publication: Survivable network activation problems

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