Improved Parameterized Algorithms for Weighted 3-Set Packing

DOI10.1007/978-3-540-69733-6_14zbMath1148.68576OpenAlexW2156035410MaRDI QIDQ3511321

Qilong Feng, Jianxin Wang

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Randomized algorithms (68W20)

Related Items (8)

Mixing Color Coding-Related Techniques ⋮ Parameterized approximation algorithms for packing problems ⋮ Parameterized counting matching and packing: a family of hard problems that admit FPTRAS ⋮ Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets ⋮ Parameterized algorithms for weighted matching and packing problems ⋮ Improved deterministic algorithms for weighted matching and packing problems ⋮ A Problem Kernelization for Graph Packing ⋮ The \(k\)-distinct language: parameterized automata constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved parameterized set splitting algorithms: A Probabilistic approach
• Greedy Local Improvement and Weighted Set Packing Approximation
• On Local Search for Weighted k-Set Packing
• Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
• An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
• Color-coding
• Parameterized Algorithms for Weighted Matching and Packing Problems
• Algorithms – ESA 2004
• Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)

This page was built for publication: Improved Parameterized Algorithms for Weighted 3-Set Packing