Improved Deterministic Algorithms for Weighted Matching and Packing Problems

DOI10.1007/978-3-642-02017-9_24zbMath1241.68128OpenAlexW4252391495MaRDI QIDQ3630206

Yang Liu, Jianxin Wang, Songjian Lu, Qilong Feng

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

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

Related Items (3)

Matching and weighted \(P_2\)-packing: algorithms and kernels ⋮ Packing paths: recycling saves time ⋮ An improved kernelization for \(P_{2}\)-packing

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