Matching and P2-packing: weighted versions

Authors:
Qilong Feng;Jianxin Wang;Jianer Chen
Affiliations:
School of Information Science and Engineering, Central South University, Changsha, P.R. China;School of Information Science and Engineering, Central South University, Changsha, P.R. China;School of Information Science and Engineering, Central South University, Changsha, P.R. China and Department of Computer Science and Engineering, Texas A&M University, College Station, Texas
Venue:
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Year:
2011

Citing 17
Cited 1

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
Graph algorithms

Handbook of theoretical computer science (vol. A)
Maximum bounded H-matching is Max SNP-complete

Information Processing Letters
Data structures for weighted matching and nearest common ancestors with linking

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Scheduling split intervals

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Splitters and near-optimal derandomization

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On the completeness of a generalized matching problem

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Looking at the stars

Theoretical Computer Science - Parameterized and exact computation
The Pk Partition Problem and Related Problems in Bipartite Graphs

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Faster Algebraic Algorithms for Path and Packing Problems

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Improved Parameterized Set Splitting Algorithms: A Probabilistic Approach

Algorithmica
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
Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
An approximation algorithm for maximum triangle packing

Discrete Applied Mathematics
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
An improved parameterized algorithm for a generalized matching problem

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Finding k disjoint triangles in an arbitrary graph

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

Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parameterized algorithms are presented for the weighted P2- Packing problem, which is a generalization of the famous Graph Matching problem. The algorithms are based on the following new techniques and observations: (1) new study on structure relationship between graph matchings in general graphs and P2-packings in bipartite graphs; (2) an effective graph bi-partitioning algorithm; and (3) a polynomial-time algorithm for a constrained weighted P2-Packing problem in bipartite graphs. These techniques lead to randomized and deterministic parameterized algorithms that significantly improve the previous best upper bounds for the problem for both weighted and unweighted versions.