The following publications are possibly variants of this publication:
- Approximating Minimum-Power Degree and Connectivity ProblemsGuy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko. algorithmica, 60(4):735-742, 2011. [doi]
- Approximating minimum cost connectivity problemsGuy Kortsarz, Zeev Nutov. Dagstuhl 2009: [doi]
- Approximating minimum power covers of intersecting families and directed edge-connectivity problemsZeev Nutov. TCS, 411(26-28):2502-2512, 2010. [doi]
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity ProblemsZeev Nutov. approx 2006: 236-247 [doi]
- Approximating Minimum-Power k-ConnectivityZeev Nutov. ahswn, 9(1-2):129-137, 2010. [doi]
- Approximating Minimum-Power k-ConnectivityZeev Nutov. adhoc-now 2008: 86-93 [doi]
- On minimum power connectivity problemsYuval Lando, Zeev Nutov. jda, 8(2):164-173, 2010. [doi]
- On Minimum Power Connectivity ProblemsYuval Lando, Zeev Nutov. esa 2007: 87-98 [doi]
- Approximating connectivity augmentation problemsZeev Nutov. TALG, 6(1), 2009. [doi]
- Approximating connectivity augmentation problemsZeev Nutov. soda 2005: 176-185 [doi]