The Pk partition problem and related problems in bipartite graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4362 LNCS, Issue , 2007, Pages 422-433

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

^a UNIVERSITÉ PARIS DAUPHINE   (France)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

BIPARTITE GRAPHS; OPTIMIZATION VERSION; PARTITION PROBLEMS; VERTEX DISJOINT;

GRAPH THEORY;

EID: 38149106483     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69507-3_36     Document Type: Conference Paper

References (22)

1. Arkin, E. and Hassin, R.: On Local Search for Weighted Packing Problems. Mathematics of Operations Research 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). Springer, Berlin (1999)
3. Bazgan, C., Hassin, R., and Monnot, J.: Approximation Algorithms for Some Routing Problems. Discrete Applied Mathematics 146 (2005) 3-26
4. Chazelle, B.: A Minimum Spanning Tree Algorithm with Inverse-Ackermann Type Complexity. J. ACM 47 (2000) 1028-1047
5. Csaba, B., Karpinski, M., and Krysta, P.: Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems. SODA (2002) 74-83
6. Dyer, M., Frieze, A.: Planar 3DM is NP-Complete. J. Algorithms 7 (1986) 174-184
7. Frank, A.: Some Polynomial Time Algorithms for Certain Graphs and Hypergraphs. Proceedings of the 5th British Combinatorial Conference, Congressus Numerantium XV, Utilitas Mathematicae, Winnipeg (1976) 211-226
8. Garey, M.R. and Johnson, D.S.: Computers and Intractability. A guide to the Theory of NP-Completeness. CA, Freeman (1979)
9. Hassin, R. and Rubinstein, S.: An Approximation Algorithm for Maximum Packing of 3-Edge Paths. Inf. Process. Lett. 63 (1997) 63-67
10. Hassin, R. and Rubinstein, S.: An Approximation Algorithm for Maximum Triangle Packing. ESA, LNCS 3221 (2004) 403-413
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. Journal of Combinatorial Theory, Series B 88 (2003) 195-218
12. Karpinski, M.: Personnal communication. (2006)
13. Kirkpatrick, D.G. and Hell, P.: On the Completeness of a Generalized Matching Problem. Proc. STOC'78 (1978) 240-245
14. Lovasz, L. and Plummer, M.D.: Matching Theory. North-Holland, Amsterdam (1986)
15. 4 Partition Problem. The Symposia on Fundamentals of Computation Theory, F.C.T.'2005, LNCS 3623 (2005) 377-385
16. k Partition Problem and Related Problems in Bipartite Graphs. Technical Report (2006) (available at http://www.lamsade.dauphine.fr/~monnot/publications(journal).htm)
17. Petrank, E.: The Hardness of Approximation: Gap Location. Computational Complexity 4 (1994) 133-157
18. Steiner, G.: On the k-Path Partition Problem in Cographs. Cong. Numer. 147 (2000) 89-96
19. Steiner, G.: On the k-Path Partition of Graphs. Theor. Comput. Sci. 290 (2003) 2147-2155
20. Wang, H.: Path Factors of Bipartite Graphs. Journal of Graph Theory 18 (1994) 161-167
21. Vishwanathan, S.: An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two. Information Processing Letter 44 6 (1992) 297-302
22. Yan, J.-H., Chang, G.J., Hedetniemi, S.M., and Hedetniemi, S.T.: k-Path Partitions in Trees. Discrete Applied Mathematics 78 (1997) 227-233