Vera Traub

Vera Traub is an Associate Professor in the Department of Computer Science at ETH Zurich. Her research focuses on algorithms, combinatorial optimisation, and approximation algorithms, with recent work on the traveling salesman problem and network design problems such as Steiner trees. Prior to joining ETH Zurich in 2025, she was a professor at the Research Institute for Discrete Mathematics at the University of Bonn and a postdoc at ETH Zurich. She obtained her PhD from the University of Bonn in 2020, where her advisor was Jens Vygen. She is an Associate Editor of the journal Mathematics of Operations Research and has been involved in several program committees. Her publications include work on approximation algorithms for various optimization problems.

Vera Traub is a researcher at ETH Zurich, focusing on approximation algorithms for combinatorial optimization problems. Her work addresses challenges in network design, routing, and traveling salesman problems. She has made significant contributions to improving approximation ratios for problems such as weighted tree augmentation, connectivity augmentation, and capacitated vehicle routing. Traub's research also explores the theoretical foundations of approximation algorithms, including the integrality ratio of linear programming relaxations. Her publications often bridge gaps between different optimization problems, offering unified and stronger approaches. Her research has implications for both theoretical computer science and practical applications in logistics and network design.