• 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 - Request a copy

The path partition problem and related problems in bipartite graphs

Monnot, Jérôme; Toulouse, Sophie (2007), The path partition problem and related problems in bipartite graphs, Operations Research Letters, 35, 5, p. 677-684. http://dx.doi.org/10.1016/j.orl.2006.12.004

Type
Article accepté pour publication ou publié
Date
2007
Journal name
Operations Research Letters
Volume
35
Number
5
Publisher
Elsevier
Pages
677-684
Publication identifier
http://dx.doi.org/10.1016/j.orl.2006.12.004
Metadata
Show full item record
Author(s)
Monnot, Jérôme cc
Toulouse, Sophie cc
Abstract (EN)
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some approximation and inapproximation results for several related problems.
Subjects / Keywords
Pk-Partition; Path packing; Path partition; Bipartite graphs; APX-Hardness; Approximation algorithms

Related items

Showing items related by title and author.

  • Thumbnail
    The complexity of the Pk partition problem and related problems in bipartite graphs 
    Monnot, Jérôme; Toulouse, Sophie (2005) Communication / Conférence
  • Thumbnail
    The complexity of the Pk partition problem and related problems in bipartite graphs 
    Monnot, Jérôme; Toulouse, Sophie (2005) Communication / Conférence
  • Thumbnail
    Pk partition problem and related problems in bipartite graphs 
    Monnot, Jérôme; Toulouse, Sophie (2007) Communication / Conférence
  • Thumbnail
    Complexity and approximation results for bounded-size paths packing problems 
    Toulouse, Sophie; Monnot, Jérôme (2007) Chapitre d'ouvrage
  • Thumbnail
    Approximation results for the weighted P4 partition problems 
    Monnot, Jérôme; Toulouse, Sophie (2005) Communication / Conférence
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