The aim is to approximately solve minimum Steiner tree and minimum tour problems where prescribed quotas must be reached for the total weight of visited vertices. The project involves the study of both fast heuristic algorithms and algorithms with constant worst-case approximation ratio.