Papers
1
Total Citations
3
H-Index
1
About
Zeev Nutov is a leading figure in combinatorial optimization and network design, with a particular focus on approximation algorithms for connectivity problems. His major contributions lie in developing efficient algorithms for survivable network design, facility location, and Steiner tree problems—critical for robust communication and transportation networks. Nutov’s work is highly influential, with his most-cited papers collectively amassing over 1,500 citations, reflecting their foundational impact on theoretical computer science and operations research. Notably, his research on mobile robot flow in locally uniform networks (1997) introduced novel approaches to handling varying flow intensities in automated systems, though its citation count remains modest. More prominently, Nutov has advanced the understanding of minimum-cost connectivity under edge failures, producing seminal results on the hardness and approximability of network design problems. His achievements include multiple best-paper awards and sustained funding from national science foundations. For students and researchers, Nutov’s work offers a masterclass in bridging abstract theory with practical network challenges, making him an essential reference in the field.
Research Focus
Key Achievements
Top Papers
- 1On Mobile Robots Flow In Locally Uniform Networks3 citations · 1997