Parameterized algorithms for weighted matching and packing problems

DOI10.1016/j.disopt.2008.07.002zbMath1179.90296OpenAlexW2012488818MaRDI QIDQ955335

Yunlong Liu, Jianxin Wang

Publication date: 19 November 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2008.07.002

zbMATH Keywords

parameterized algorithmsweighted \(m-D\) matching problemweighted \(m\)-set packing problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Parameterized counting matching and packing: a family of hard problems that admit FPTRAS

Cites Work

• Unnamed Item
• Unnamed Item
• Exact algorithms and applications for tree-like Weighted Set Cover
• Greedy Local Improvement and Weighted Set Packing Approximation
• Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
• An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
• Improved Parameterized Algorithms for Weighted 3-Set Packing
• Color-coding
• An efficient parameterized algorithm for m-set packing
• Parameterized and Exact Computation
• Algorithms – ESA 2004
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Parameterized algorithms for weighted matching and packing problems