A parameterized perspective on packing paths of length two

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

Volumn 5165 LNCS, Issue , 2008, Pages 54-63

  Fernau, Henning ^a   Raible, Daniel ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BEVERAGES; COMBINATORIAL MATHEMATICS; OPTIMIZATION; PACKING;

INTERNATIONAL CONFERENCES; PARAMETERIZED;

COMBINATORIAL OPTIMIZATION;

EID: 51849125490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85097-7_6     Document Type: Conference Paper

References (15)

1. De Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Progr. Ser. B 98, 477-491 (2003)
2. Chen, J., Fernau, H., Kanj, Y.A., Xia, G.: Parametric duality and kernelization: lower bounds and upper bounds on kernel size. SIAM Journal on Computing 37, 1077-1108 (2007)
3. Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Bansal, N., Pruhs, K., Stein, C. (eds.) Symposium on Discrete Algorithms SODA, pp. 298-307. SIAM, Philadelphia (2007)
4. Cotta, C., Moscato, P.: On the parameterized complextiy of problems related with feature identification for gene expression data mining techniques. Bioinformatics 1, 1-8 (2002)
5. Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is P-time extremal structure I. In: Broersma, H., Johnson, M., Szeider, S. (eds.) Algorithms and Complexity in Durham ACiD 2005. Texts in Algorithmics, vol. 4, pp. 1-41. King's College Publications (2005)
6. Fernau, H., Manlove, D.F.: Vertex and edge covers with clustering properties: Complexity and algorithms. In: Algorithms and Complexity in Durham ACiD 2006, pp. 69-84. King's College, London (2006)
7. Hassin, R., Rubinstein, S.: An approximation algorithm for maximum of 3-edge paths. Information Processing Letters 63, 63-67 (1997)
8. Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Applied Mathematics 154, 971-979; 2620 [Erratum] (2006)
9. Hell, P., Kirkpatrick, D.G.: Star factors and star packings. Technical Report 82-6, Computing Science, Simon Fraser University, Burnaby, B.C. V5A1S6, Canada (1982)
10. Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. Journal of Algorithms 50, 106-117 (2004)
11. Kirkpatrick, D.G., Hell, P.: On the completeness of a generalized matching problem. In: ACM Symposium on Theory of Computing STOC, pp. 240-245 (1978)
12. Liu, Y., Lu, S., Chen, J., Sze, S.-H.: Greedy localization and color-coding: improved matching and packing algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 84-95. Springer, Heidelberg (2006)
13. Prieto, E., Sloper, C.: Looking at the stars. In: Downey, R., Fellows, M., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 138-148. Springer, Heidelberg (2004)
14. 3k) parameterized algorithm for 3-set packing. In: Agrawal, M., et al. (eds.) Theory and Applications of Models of Computation TAMC. LNCS, vol. 4978, pp. 82-93. Springer, Heidelberg (2008)
15. Wang, J., Ning, D., Feng, Q., Chen, J.: An improved parameterized algorithm for a generalized matching problem. In: Agrawal, M., Du., D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 212-222. Springer, Heidelberg (2008)