An O*(3.523k) parameterized algorithm for 3-set packing

Authors:
Jianxin Wang;Qilong Feng
Affiliations:
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 8
Cited 10

Splitters and near-optimal derandomization

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An efficient parameterized algorithm for m-set packing

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

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach

Algorithmica
A faster parameterized algorithm for set packing

Information Processing Letters
Divide-and-color

WG'06 Proceedings of the 32nd 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
Parameterized Complexity

Parameterized Complexity

Improved Parameterized Algorithms for Weighted 3-Set Packing

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
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
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
Improved deterministic algorithms for weighted matching and packing problems

Theoretical Computer Science
Matching and P2-packing: weighted versions

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching

ACM Transactions on Algorithms (TALG)
Parameterized algorithms for weighted matching and packing problems

Discrete Optimization
Packing paths: Recycling saves time

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

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Packing problems have formed an important class of NP-hard problems. In this paper, we provide further theoretical study on the structure of the problems, and design improved algorithm for packing problems. For the 3-Set Packing problem, we present a deterministic algorithm of time O*(3.523k), which significantly improves the previous best algorithm of time O*(4.613k).