( en | de | ru )

 

Disambiguation of "Nutov, Zeev"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Minimum-Power Degree and Connectivity Problems.

, , , and . LATIN, volume 4957 of Lecture Notes in Computer Science, page 423-435. Springer, (2008)

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 Weininger

 

Other publications of authors with the same name

Approximation algorithms for cycle packing problems., , and . SODA, page 556-561. SIAM, (2005)Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments., , and . IEEE/ACM Trans. Netw., 31 (6): 2483-2498 (December 2023)Packing directed cycles efficiently., and . Discret. Appl. Math., 155 (2): 82-91 (2007)Approximating Minimum-Power k-Connectivity.. ADHOC-NOW, volume 5198 of Lecture Notes in Computer Science, page 86-93. Springer, (2008)Prize-collecting steiner network problems., , , and . ACM Trans. Algorithms, 9 (1): 2:1-2:13 (2012)Tight Approximation Algorithm for Connectivity Augmentation Problems., and . ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 443-452. Springer, (2006)Approximation algorithm for k-node connected subgraphs via critical graphs., and . STOC, page 138-145. ACM, (2004)Degree-Constrained Node-Connectivity.. LATIN, volume 7256 of Lecture Notes in Computer Science, page 582-593. Springer, (2012)Approximation Algorithms for Connectivity Augmentation Problems.. CSR, volume 12730 of Lecture Notes in Computer Science, page 321-338. Springer, (2021)Approximating Some Network Design Problems with Node Costs., and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 231-243. Springer, (2009)