Complexity and approximation results for bounded-size paths packing problems
Jérôme Monnot, Sophie Toulouse · HAL (Le Centre pour la Communication Scientifique Directe) · 2007
This chapter presents some recent works given by the authors (\cite{MT05,MT07}) about the complexity and the approximation of several problems on computing collections of (vertex)-disjoint paths of bounded size.