Faster fixed-parameter tractable algorithms for matching and packing problems

Algorithmica (New York)

Volumn 52, Issue 2, 2008, Pages 167-176

  Fellows, M R ^a   Knauer, C ^b   Nishimura, N ^c   Ragde, P ^c   Rosamond, F ^a   Stege, U ^d   Thilikos, D M ^e   Whitesides, S ^f  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

^c UNIVERSITY OF WATERLOO   (Canada)

^d UNIVERSITY OF VICTORIA   (Canada)

^e UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^f MCGILL UNIVERSITY   (Canada)

Author keywords

Color coding; Fixed parameter tractable; Graph matching; Parameterized complexity; Set packing

Indexed keywords

COLOR CODING; FIXED PARAMETER TRACTABLE; FIXED-PARAMETER ALGORITHMS; GENERAL FRAMEWORK; GRAPH MATCHING; PACKING PROBLEMS; PARAMETERIZED COMPLEXITY; SET PACKING; TRACTABLE ALGORITHMS;

MATHEMATICAL PROGRAMMING; PROGRAMMING THEORY; SYSTEMS ENGINEERING;

PARAMETER ESTIMATION;

EID: 50849125777     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9146-y     Document Type: Article

References (17)

1. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42(4), 844-856 (1995)
2. Ausiello, G., D'Atri, A., Protasi, M.: Structure preserving reductions among context optimization problems. J. Comput. Syst. Sci. 21, 136-153 (1980)
3. Chen, J., Friesen, D.K., Jia, W., Kanj, I.: Using nondeterminism to design deterministic algorithms. In: Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science (FST TCS). Lecture Notes in Computer Science, vol. 2245, pp. 120-131. Springer, New York (2001)
4. Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 298-307 (2007)
5. 2) steps. In: Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004), pp. 257-269 (2004)
6. Fellows, M.R.: Blow-ups, win/win's, and crown rules: some new directions in FPT. In: Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 03). Lecture Notes in Computer Science, vol. 2880, pp. 1-12. Springer, New York (2003)
7. Fellows, M.R., Heggernes, P., Rosamond, F.A., Sloper, C., Telle, J.A.: Exact algorithms for finding k disjoint triangles in an arbitrary graph. In: Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004), pp. 257-269 (2004)
8. Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D.M., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Proceedings of the 12th Annual European Symposium on Algorithms (ESA), pp. 311-322 (2004)
9. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with o(1) worst-case access time. In: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pp. 165-169 (1982)
10. Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-set packing. J. Algorithms 50(1), 106-117 (2004)
11. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85-103. Plenum, New York (1972)
12. Kneis, J., Moelle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp. 58-67 (2006)
13. Koutis, I.: A faster parameterized algorithm for set packing. Inf. Process. Lett. 94, 7-9 (2005)
14. Liu, Y., Lu, S., Chen, J., Sze, S.: Greedy localization and color-coding: improved matching and packing algorithms. In: Proceedings of the 2nd International Workshop on Parameterized and Exact Computation. Lecture Notes in Computer Science, vol. 4162, pp. 84-95. Springer, New York (2006)
15. Marx, D.: Parameterized complexity of constraint satisfaction problems. In: Proceedings of the 19th Annual IEEE Conference on Computational Complexity, 2004
16. Slot, C.F., van Emde Boas, P.: On tape versus core; an application of space efficient perfect hash functions to the invariance of space. Elektron. Inf. Kybern. 21(4/5), 246-253 (1985)
17. Woeginger, G.J.: Exact algorithms for NP-hard problems, a survey. In: Combinatorial Optimization-Eureka, You Shrink!. Lecture Notes on Computer Science, vol. 2570, pp. 185-207. Springer, New York (2003)