Survivable Network Activation Problems

DOI10.1007/978-3-642-29344-3_50zbMath1353.68216OpenAlexW2178308067MaRDI QIDQ2894501

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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths ⋮ Approximating minimum power edge-multi-covers

This page was built for publication: Survivable Network Activation Problems