Date
2007
Dewey
Probabilités et mathématiques appliquées
Sujet
bounded size; disjoints paths; approximation; complexity
Book title
Combinatorial Optimization and Theoretical Computer Science Interfaces and Perspectives 30th anniversary of the LAMSADE
Author
Paschos, Vangelis T.
Publisher
WILEY
Publisher city
Londres, Hoboken
Year
2007
Pages number
515
ISBN
978-1905209996
Author
Toulouse, Sophie
Monnot, Jérôme
Type
Chapitre d'ouvrage
Item number of pages
455-493
Abstract (EN)
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.
