Thumbnail - No thumbnail

Complexity and approximation results for bounded-size paths packing problems

Toulouse, Sophie; Monnot, Jérôme (2007), Complexity and approximation results for bounded-size paths packing problems, in Paschos, Vangelis T., Combinatorial Optimization and Theoretical Computer Science Interfaces and Perspectives 30th anniversary of the LAMSADE, WILEY : Londres, Hoboken, p. 455-493

Type
Chapitre d'ouvrage
External document link
http://hal.archives-ouvertes.fr/hal-00152277/fr/
Date
2007
Book title
Combinatorial Optimization and Theoretical Computer Science Interfaces and Perspectives 30th anniversary of the LAMSADE
Book author
Paschos, Vangelis T.
Publisher
WILEY
Published in
Londres, Hoboken
ISBN
978-1905209996
Number of pages
515
Pages
455-493
Metadata
Show full item record
Author(s)
Toulouse, Sophie cc
Monnot, Jérôme cc
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.
Subjects / Keywords
bounded size; disjoints paths; approximation; complexity