An improved parameterized algorithm for a generalized matching problem

Authors:
Jianxin Wang;Dan Ning;Qilong Feng;Jianer Chen
Affiliations:
School of Information Science and Engineering, Central South University;School of Information Science and Engineering, Central South University;School of Information Science and Engineering, Central South University;School of Information Science and Engineering, Central South University
Venue:
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Year:
2008

Citing 4
Cited 6

On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems

SIAM Journal on Discrete Mathematics
Maximum bounded H-matching is Max SNP-complete

Information Processing Letters
Looking at the stars

Theoretical Computer Science - Parameterized and exact computation
Finding k disjoint triangles in an arbitrary graph

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

A Parameterized Perspective on Packing Paths of Length Two

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
A Problem Kernelization for Graph Packing

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
A generalization of Nemhauser and Trotter's local optimization theorem

Journal of Computer and System Sciences
Matching and P2-packing: weighted versions

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Packing paths: Recycling saves time

Discrete Applied Mathematics
Matching and Weighted P2-Packing: Algorithms and Kernels

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the parameterized complexity of a generalized matching problem, the P2-packing problem. The problem is NP-hard and has been studied by a number of researchers. In this paper, we provide further study of the structures of the P2-packing problem, and propose a new kernelization algorithm that produces a kernel of size 7k for the problem, improving the previous best kernel size 15k. The new kernelization leads to an improved algorithm for the problem with running time O*(24.142k), improving the previous best algorithm of time O*(25.301k).