Parameterized algorithms for weighted matching and packing problems

Authors:
Yunlong Liu;Jianer Chen;Jianxin Wang
Affiliations:
College of Information Science and Engineering, Central South University, Changsha, P.R. China and School of Continuing Education, Hunan Normal University, Changsha, P.R. China;College of Information Science and Engineering, Central South University, Changsha, P.R. China and Department of Computer Science Texas AM University, College Station, TX;College of Information Science and Engineering, Central South University, Changsha, P.R. China
Venue:
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Year:
2007

Citing 8
Cited 5

Color-coding

Journal of the ACM (JACM)
Greedy local improvement and weighted set packing approximation

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An efficient parameterized algorithm for m-set packing

Journal of Algorithms
Exact algorithms and applications for Tree-like Weighted Set Cover

Journal of Discrete Algorithms
Improved algorithms for path, matching, and packing problems

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Finding k disjoint triangles in an arbitrary graph

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Greedy localization and color-coding: improved matching and packing algorithms

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation

Improved Parameterized Algorithms for Weighted 3-Set Packing

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Quadratic Kernel for 3-Set Packing

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Improved Deterministic Algorithms for Weighted Matching and Packing Problems

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
An improved kernelization algorithm for r-Set Packing

Information Processing Letters
A dynamic programming algorithm for tree-like weighted set packing problem

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The weighted m-D matching and m-set packing problems (m ≥ 3) are usually solved through approximation algorithms. In this paper, we define the parameterized versions of these problems and study their algorithms. For the weighted m-set packing problem, we develop a parameterized algorithm of running time O(12.8mknO(1)), which is based on the recently improved color-coding technology and dynamic programming. By refining the techniques, we also develop a more efficient parameterized algorithm of running time O(12.8(m-1)knO(1)) for the weighted m-d matching problem, which is a restricted version of the weighted m-set packing problem.