Vera Traub
From Wikipedia, the free encyclopedia
Vera Traub is a German applied mathematician and theoretical computer scientist known for her research on approximation algorithms for combinatorial optimization problems including the travelling salesperson problem and the Steiner tree problem. She is a junior professor in the Institute for Discrete Mathematics at the University of Bonn.[1]
Traub earned a bachelor's degree at the University of Bonn in 2015.[2] She completed her doctorate (Dr. rer. nat.) there in 2020, with the dissertation Approximation Algorithms for Traveling Salesman Problems supervised by Jens Vygen.[3] She was a postdoctoral researcher for Rico Zenklusen at ETH Zurich[4][5] before taking her present position at the University of Bonn.[1][5]
