Approximation algorithms for routing and connectivity problems with multiple distance functions

"Approximation algorithms for routing and connectivity problems with multiple distance functions" (Master's). Candidate: Greis Yvet Oropeza Quesquén. Advisor: professor Lehilton Lelis Chaves Pedrosa. August 12, 2020, at 14 pm, entirely remotely.