The path partition problem and related problems in bipartite graphs

Operations Research Letters

Volumn 35, Issue 5, 2007, Pages 677-684

  Monnot, Jérôme ^a   Toulouse, Sophie ^b  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

Approximation algorithms; APX Hardness; Bipartite graphs; Pk Partition; Path packing; Path partition

Indexed keywords

APPROXIMATION ALGORITHMS; MOTION PLANNING; PROBLEM SOLVING;

APX-HARDNESS; PATH PACKING; PATH PARTITION;

GRAPH THEORY;

EID: 34547608699     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2006.12.004     Document Type: Article

References (21)

1. Arkin E., and Hassin R. On local search for weighted packing problems. Math. Oper. Res. 23 (1998) 640-648
2. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties (1999), Springer, Berlin
3. Bazgan C., Hassin R., and Monnot J. Approximation algorithms for some routing problems. Discrete Appl. Math. 146 (2005) 3-26
4. Chazelle B. A minimum spanning tree algorithm with Inverse-Ackermann type complexity. J. ACM 47 (2000) 1028-1047
5. B. Csaba, M. Karpinski, P. Krysta, Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems, SODA (2002) 74-83.
6. Dyer M., and Frieze A. Planar 3DM is NP-complete. J. Algorithms 7 (1986) 174-184
7. A. Frank, Some polynomial time algorithms for certain graphs and hypergraphs, Proceedings of the Fifth British Combinatorial Conference, Congressus Numerantium XV, Utilitas Mathematicae, Winnipeg, 1976, pp. 211-226.
8. Garey M.R., and Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-completeness (1979), Freeman, CA
9. Hassin R., and Rubinstein S. An approximation algorithm for maximum packing of 3-edge paths. Inform. Process. Lett. 63 (1997) 63-67
10. Hassin R., and Rubinstein S. An approximation algorithm for maximum triangle packing. Discrete Appl. Math. 154 (2006) 971-979
11. Kaneko A. A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. J. Combin. Theory Ser. B 88 (2003) 195-218
12. M. Karpinski, Personnal communication, 2006.
13. D.G. Kirkpatrick, P. Hell, On the completeness of a generalized matching problem, Proceedings of the STOC'78, 1978, pp. 240-245.
14. Lovasz L., and Plummer M.D. Matching Theory (1986), North-Holland, Amsterdam
15. 4 partition problem, The Symposia on Fundamentals of Computation Theory, F.C.T.'2005, Lecture Notes in Computer Science, vol. 3623, Springer, Berlin, 2005, pp. 377-385.
16. Petrank E. The hardness of approximation: gap location. Comput. Complexity 4 (1994) 133-157
17. Steiner G. On the k-path partition of graphs. Theor. Comput. Sci. 290 3 (2003) 2147-2155
18. Steiner G. k-Path partitions in trees. Theor. Comput. Sci. 290 (2003) 2147-2155
19. Vishwanathan S. An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inform. Process. Lett. 44 6 (1992) 297-302
20. Wang H. Path factors of bipartite graphs. J. Graph Theory 18 (1994) 161-167
21. J.-H. Yan, G.J. Chang, S.M. Hedetniemi, S.T. Hedetniemi, k-path partitions in trees, 78 (1-3) (1997) 227-233.