The path partition problem and related problems in bipartite graphs

被引：47
|
作者：
Monnot, Jerome
Toulouse, Sophie
机构：
[1] Univ Paris 09, LAMSADE, CNRS, UMR 7024, F-75775 Paris 16, France
[2] Univ Paris 13, Inst Galilee, LIPN, CNRS,UMR 7030, F-93430 Villetaneuse, France
来源：
OPERATIONS RESEARCH LETTERS | 2007年 / 35卷 / 05期
关键词：
P-k-partition; path packing; path partition; bipartite graphs; APX-hardness; approximation algorithms; APPROXIMATION ALGORITHM;
D O I：
10.1016/j.orl.2006.12.004
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
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. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：677 / 684
页数：8
相关论文
共 50 条
12345