Parameterized algorithms for weighted matching and packing problems

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

Volumn 4484 LNCS, Issue , 2007, Pages 692-702

  Yunlong, Liu ^a,b   Jianer, Chen ^a,c   Jianxin, Wang ^a  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b HUNAN NORMAL UNIVERSITY   (China)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; NUMERICAL METHODS; PARAMETERIZATION;

COLOR-CODING TECHNOLOGY; EFFICIENT ALGORITHMS; PARAMETERIZED ALGORITHMS;

PROBLEM SOLVING;

EID: 35448974019     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. N. ALON, R. YUSTER, AND U. ZWICK, Color-coding, Journal of the ACM 42, (1995), pp. 844-856.
2. B. CHANDRA AND M. HALLDORSSON, Greedy local improvement and weighted set packing approximation, Journal of Algorithms 39, (2001), pp. 223-240.
3. J. CHEN, S. LU, S.-H. SZE, AND F. ZHANG, Improved algorithms for path, matching, and packing problems, Proc. 18th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 07), (2007), pp. 298-307.
4. M. FELLOWS, P. HEGGERNES, F. ROSAMOND, C. SLOPER, AND J. TELLE, Finding k disjoint triangles in an arbitrary graph, Lecture Notes in Computer Science 3353 (WG 2004), (2004), pp. 235-244.
5. M. R. FELLOWS, C. KNAUER, N. NISHIMURA, P. RAGDE, F. ROSAMOND, U. STEGE, D. THILIKOS, AND S. WHITESIDES, Faster Fixed-parameter tractable algorithms for matching and packing problems, Lecture Notes in Computer Science 3221 (ESA 2004), (2004), pp. 311-322.
6. H. FERNAU, Parameterized maximization, Technical Report WSI-2001-22, UniversityTubingen (Germany), Wilhelm-Schickard-Institut fur Informatik, (2001).
7. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman Co., 1979.
8. J. GUO AND R. NIEDERMEIER, Exact algorithms and applications for tree-like weighted set cover. Journal of Discrete Algorithms 4, (2006), pp. 608-622.
9. W. JIA, C. ZHANG, AND J. CHEN, An efficient parameterized algorithm for m-Set Packing, Journal of Algorithms 50, (2004), pp. 106-117.
10. Y. LIU, S. LU, J. CHEN, AND S.-H. SZE, Greedy localization and color-coding: improved matching and packing algorithms, Lecture Notes in Computer Science 4169 (IWPEC 06), (2006), pp. 84-95.
11. L. MATHIESON, E. PRIETO, AND P. SHAW, Packing edge disjoint triangles: a parameterized view, Lecture Notes in Computer Science 3162 (IWPEC 2004), (2004), pp. 127-137.