Improved Parameterized Algorithms for Weighted 3-Set Packing

Authors:
Jianxin Wang;Qilong Feng
Affiliations:
School of Information Science and Engineering, Central South University, Changsha, P.R. China 410083;School of Information Science and Engineering, Central South University, Changsha, P.R. China 410083
Venue:
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Year:
2008

Citing 11
Cited 4

Color-coding

Journal of the ACM (JACM)
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)

Discrete Applied Mathematics - Special volume on computational molecular biology
Greedy local improvement and weighted set packing approximation

Journal of Algorithms
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Splitters and near-optimal derandomization

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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
Parameterized algorithms for weighted matching and packing problems

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
An O*(3.523k) parameterized algorithm for 3-set packing

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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

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
Parameterized algorithms for weighted matching and packing problems

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Packing problems form an important class of NP-hard problems. For the weighted 3-Set Packing problem, we provide further theoretical study on the problem and present a deterministic algorithm of time O*(10.63k). Based on the randomized divide-and-conquer method, the above result can be further reduced to O*(7.563k), which significantly improves the previous best result O*(12.83k).