The following publications are possibly variants of this publication:
- Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable BifamiliesZeev Nutov. TALG, 14(3), 2018. [doi]
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover DecompositionsZeev Nutov. focs 2009: 417-426 [doi]
- Approximating minimum cost connectivity problemsGuy Kortsarz, Zeev Nutov. Dagstuhl 2009: [doi]
- Approximating Node Connectivity Problems via Set CoversGuy Kortsarz, Zeev Nutov. algorithmica, 37(2):75-92, 2003. [doi]
- Approximating node connectivity problems via set coversGuy Kortsarz, Zeev Nutov. approx 2000: 194-205 [doi]
- Approximating Minimum-Power Degree and Connectivity ProblemsGuy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko. algorithmica, 60(4):735-742, 2011. [doi]
- Approximating Minimum-Power Degree and Connectivity ProblemsGuy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena Tsanko. latin 2008: 423-435 [doi]
- Approximating connectivity augmentation problemsZeev Nutov. TALG, 6(1), 2009. [doi]
- Approximating connectivity augmentation problemsZeev Nutov. soda 2005: 176-185 [doi]