Approximation Algorithms for Vector-Valued Shortest Path and Group Steiner Tree Problems

This paper presents polylogarithmic approximation algorithms for variants of the Shortest Path, Group Steiner Tree, and Group ATSP problems with vector-valued edge costs.