The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
An efficient parameterized algorithm for m-set packing
Journal of Algorithms
Theoretical Computer Science - Parameterized and exact computation
A faster parameterized algorithm for set packing
Information Processing Letters
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Parameterized Complexity
Improved algorithms for path, matching, and packing problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Constant ratio fixed-parameter approximation of the edge multicut problem
Information Processing Letters
On problems without polynomial kernels
Journal of Computer and System Sciences
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
Finding heaviest H-subgraphs in real weighted graphs, with applications
ACM Transactions on Algorithms (TALG)
A dynamic programming algorithm for tree-like weighted set packing problem
Information Sciences: an International Journal
An O*(3.533k)-time parameterized algorithm for the 3-set packing problem
Theoretical Computer Science
Improved deterministic algorithms for weighted matching and packing problems
Theoretical Computer Science
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
A randomized approximation algorithm for parameterized 3-D matching counting problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Improved algorithms for weighted and unweighted set splitting problems
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Packing paths: Recycling saves time
Discrete Applied Mathematics
Hi-index | 0.00 |
Matching and packing problems have formed an important class of NP-hard problems. There have been a number of recently developed techniques for parameterized algorithms for these problems, including greedy localization, color-coding plus dynamic programming, and randomized divide-and-conquer. In this paper, we provide further theoretical study on the structures of these problems, and develop improved algorithmic methods that combine existing and new techniques to obtain improved algorithms for matching and packing problems. For the 3-set packing problem, we present a deterministic algorithm of time O*(4.613k), which significantly improves the previous best deterministic algorithm of time O*(12.83k). For the 3-d matching problem, we develop a new randomized algorithm of running time O*(2.323k) and a new deterministic algorithm of running time O*(2.773k). Our randomized algorithm improves the previous best randomized algorithm of running time O*(2.523k), and our deterministic algorithm significantly improves the previous best deterministic algorithm of running time O*(12.83k). Our results also imply improved algorithms for various triangle packing problems in graphs.