Improved Deterministic Algorithms for Weighted Matching and Packing Problems

DOI10.1007/978-3-642-02017-9_24MaRDI QIDQ3630206zbMATH OpenOpenAlexFDO

Authors Qilong Feng, Yang Liu, Songjian Lu, Jianxin Wang

Publication date 3 June 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-02017-9_24

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Improved deterministic algorithms for weighted matching and packing problems
• Parameterized Algorithms for Weighted Matching and Packing Problems
• Parameterized algorithms for weighted matching and packing problems
• Deterministic algorithms for matching and packing problems based on representative sets
• Improved Parameterized Algorithms for Weighted 3-Set Packing

Cited in

(9)

• Packing paths: recycling saves time
• An improved algorithm for weighted 3-set packing
• Deterministic algorithms for matching and packing problems based on representative sets
• Matching and weighted \(P_2\)-packing: algorithms and kernels
• Improved deterministic algorithms for weighted matching and packing problems
• Parameterized Algorithms for Weighted Matching and Packing Problems
• Parameterized algorithms for weighted matching and packing problems
• Faster fixed-parameter tractable algorithms for matching and packing problems
• An improved kernelization for \(P_{2}\)-packing

This page was built for publication: Improved Deterministic Algorithms for Weighted Matching and Packing Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630206)