The Complexity of Approximating the Class Steiner Tree Problem

A polylogarithmic approximation algorithm for the group Steiner tree problem

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

On the complexity of approximating tsp with neighborhoods and related problems

Computational Complexity

Some formulations for the group steiner tree problem

Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile

Complexity of minimum corridor guarding problems

Information Processing Letters