Complexity and approximation results for bounded-size paths packing problems

Jérôme Monnot (1) , Sophie Toulouse (2)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 LIPN - Laboratoire d'Informatique de Paris-Nord

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.

Domaines: Complexité [cs.CC]

Jérôme Monnot, Sophie Toulouse. Complexity and approximation results for bounded-size paths packing problems. Vangelis Th. Paschos. Combinatorial Optimization and Theoretical Computer Science Interfaces and Perspectives 30th anniversary of the LAMSADE, ISTE, not printed yet, 2007. ⟨hal-00152277⟩