• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

The path partition problem and related problems in bipartite graphs

Thumbnail
Date
2007
Dewey
Recherche opérationnelle
Sujet
Pk-Partition; Path packing; Path partition; Bipartite graphs; APX-Hardness; Approximation algorithms
Journal issue
Operations Research Letters
Volume
35
Number
5
Publication date
2007
Article pages
677-684
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.orl.2006.12.004
URI
https://basepub.dauphine.fr/handle/123456789/2546
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Monnot, Jérôme
Toulouse, Sophie
Type
Article accepté pour publication ou publié
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.