• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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

Related items

Showing items related by title and author.

  • Thumbnail
    Differential approximation results for the traveling salesman problem with distances 1 and 2 
    Toulouse, Sophie; Paschos, Vangelis; Monnot, Jérôme (2003) Article accepté pour publication ou publié
  • Thumbnail
    Differential approximation results for the traveling salesman problem with distances 1 and 2 
    Monnot, Jérôme; Paschos, Vangelis; Toulouse, Sophie (2001) Communication / Conférence
  • Thumbnail
    Approximation results for the weighted P4 partition problems 
    Monnot, Jérôme; Toulouse, Sophie (2005) Communication / Conférence
  • Thumbnail
    Approximation results for the weighted P4 partition problems 
    Toulouse, Sophie; Monnot, Jérôme (2008) Article accepté pour publication ou publié
  • Thumbnail
    Complexity and Approximation Results for the Connected Vertex Cover Problem in Graphs and Hypergraphs 
    Monnot, Jérôme; Gourvès, Laurent; Escoffier, Bruno (2010) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo