( en | de | ru )

 

Disambiguation of "Nutov, Zeev"

Author of the publication

copydeleteadd this publication to your clipboard
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.

, , and . SIAM J. Comput., 44 (5): 1202-1229 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Zeev Raz

Ludger Zeevaert

Zeev Rudberg

Zeev Israeli

Zeev Siegmann

 

Other publications of authors with the same name

Improved approximation algorithms for k-connected m-dominating set problems.. Inf. Process. Lett., (2018)Approximation Algorithm for Directed Multicuts., , and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 61-67. Springer, (2004)On Minimum Power Connectivity Problems., and . ESA, volume 4698 of Lecture Notes in Computer Science, page 87-98. Springer, (2007)A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2., and . ACM Trans. Algorithms, 12 (2): 23:1-23:20 (2016)Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies.. ACM Trans. Algorithms, 14 (3): 37:1-37:8 (2018)Approximating activation edge-cover and facility location problems., and . CoRR, (2018)Approximating k-outconnected Subgraph Problems., , and . APPROX, volume 1444 of Lecture Notes in Computer Science, page 77-88. Springer, (1998)Node-Connectivity Survivable Network Problems.. Handbook of Approximation Algorithms and Metaheuristics (2), Chapman and Hall/CRC, (2018)The k-Connected Subgraph Problem.. Handbook of Approximation Algorithms and Metaheuristics (2), Chapman and Hall/CRC, (2018)Steiner Forest Orientation Problems., , and . SIAM J. Discret. Math., 27 (3): 1503-1513 (2013)